Gabriela Montiel-Moreno, J. Zechinelli-Martini, Genoveva Vargas-Solar
This paper presents an approach for managing an autonomic data space, able to automatically define views that fulfill the requirements of a set of users, and adjust them as the data space evolves. An autonomic data space deals with incomplete knowledge to manage itself because of the heterogeneity and the lack of metadata related to the resources it integrates. Our approach exploits the expressiveness of stable models and the K action language for expressing the data space management functions. It is based on a model for specifying an autonomic dataspace expressed using answer set programming (ASP). ASP is a type of declarative logic programming particularly useful in knowledge-intensive applications. It is based on the stable semantics (answer sets), which allows negation as failure and applies the ideas of auto-epistemic logic to distinguish between what is true and what is believed.
{"title":"Modelling autonomic dataspaces using answer sets","authors":"Gabriela Montiel-Moreno, J. Zechinelli-Martini, Genoveva Vargas-Solar","doi":"10.4114/IA.V14I48.1600","DOIUrl":"https://doi.org/10.4114/IA.V14I48.1600","url":null,"abstract":"This paper presents an approach for managing an autonomic data space, able to automatically define views that fulfill the requirements of a set of users, and adjust them as the data space evolves. An autonomic data space deals with incomplete knowledge to manage itself because of the heterogeneity and the lack of metadata related to the resources it integrates. Our approach exploits the expressiveness of stable models and the K action language for expressing the data space management functions. It is based on a model for specifying an autonomic dataspace expressed using answer set programming (ASP). ASP is a type of declarative logic programming particularly useful in knowledge-intensive applications. It is based on the stable semantics (answer sets), which allows negation as failure and applies the ideas of auto-epistemic logic to distinguish between what is true and what is believed.","PeriodicalId":287552,"journal":{"name":"Latin-American Workshop on Non-Monotonic Reasoning","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133557297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We build upon recent work by Lierler that denes an abstract framework for describing the algorithm underlying many of the existing answer set solvers (for answer set programs, based upon the Answer Set Seman- tics), considering in particular Smodels and SUP. We dene a particular class of programs, called AOH, and prove that the computation that the abstract solver performs actually represents a lower bound for deciding inconsis- tency of logic programs under the Answer Set Semantics. The main result is that for a given AOH program with n atoms, an algorithm that conforms to Lierler's abstract model needs ( n) steps before exiting with failure (no answer set exists). We argue that our result holds for every logic program that, like AOH programs, contains cyclic denitions and rules that can be seen as connecting the cycles.
{"title":"A Lower-Bound for Answer Set Solver Computation","authors":"S. Costantini, A. Provetti","doi":"10.4114/IA.V14I48.1630","DOIUrl":"https://doi.org/10.4114/IA.V14I48.1630","url":null,"abstract":"We build upon recent work by Lierler that denes an abstract framework for describing the algorithm underlying many of the existing answer set solvers (for answer set programs, based upon the Answer Set Seman- tics), considering in particular Smodels and SUP. We dene a particular class of programs, called AOH, and prove that the computation that the abstract solver performs actually represents a lower bound for deciding inconsis- tency of logic programs under the Answer Set Semantics. The main result is that for a given AOH program with n atoms, an algorithm that conforms to Lierler's abstract model needs ( n) steps before exiting with failure (no answer set exists). We argue that our result holds for every logic program that, like AOH programs, contains cyclic denitions and rules that can be seen as connecting the cycles.","PeriodicalId":287552,"journal":{"name":"Latin-American Workshop on Non-Monotonic Reasoning","volume":"15 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128987118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：