发布求助
文献互助 智能选刊 最新文献

Latin-American Workshop on Non-Monotonic Reasoning最新文献

筛选
英文 中文
Modelling autonomic dataspaces using answer sets 使用答案集建模自主数据空间
Latin-American Workshop on Non-Monotonic Reasoning Pub Date : 2010-06-14 DOI: 10.4114/IA.V14I48.1600
Gabriela Montiel-Moreno, J. Zechinelli-Martini, Genoveva Vargas-Solar
{"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}
引用次数: 4
A Lower-Bound for Answer Set Solver Computation 答案集求解器计算的下界
Latin-American Workshop on Non-Monotonic Reasoning Pub Date : 1900-01-01 DOI: 10.4114/IA.V14I48.1630
S. Costantini, A. Provetti
{"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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信