the loop formula based semantics of description logic programs
文献类型：期刊论文
| 作者 | Yisong Wang ; Jia-Huai You ; Li Yan Yuan ; Yi-Dong Shen ; Mingyi Zhang |
| 刊名 | Theoretical Computer Science
 |
| 出版日期 | 2011 |
| 卷号 | 415页码:- |
| ISSN号 | 0304-3975 |
| 关键词 | Semantic web Answer sets Description logic programs Loop formulas |
| 中文摘要 | Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logics, for the Semantic Web. In this paper, we generalize the notions of completion and loop formulas of logic programs to description logic programs and show that the answer sets of a dl-program can be precisely captured by the models of its completion and loop formulas. Furthermore, we propose a new, alternative semantics for dl-programs, called the canonical answer set semantics, which is defined by the models of completion that satisfy what are called canonical loop formulas. A desirable property of canonical answer sets is that they are free of circular justifications. Some properties of canonical answer sets are also explored and we compare the canonical answer set semantics with the FLP-semantics and the answer set semantics by translating dl-programs into logic programs with abstract constraints. We present a clear picture on the relationship among these semantics variations for dl-programs. |
| 英文摘要 | Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logics, for the Semantic Web. In this paper, we generalize the notions of completion and loop formulas of logic programs to description logic programs and show that the answer sets of a dl-program can be precisely captured by the models of its completion and loop formulas. Furthermore, we propose a new, alternative semantics for dl-programs, called the canonical answer set semantics, which is defined by the models of completion that satisfy what are called canonical loop formulas. A desirable property of canonical answer sets is that they are free of circular justifications. Some properties of canonical answer sets are also explored and we compare the canonical answer set semantics with the FLP-semantics and the answer set semantics by translating dl-programs into logic programs with abstract constraints. We present a clear picture on the relationship among these semantics variations for dl-programs. |
| 收录类别 | SCIENCEDIRECT ; EI |
| 语种 | 英语 |
| 公开日期 | 2013-10-08 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16017]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Yisong Wang,Jia-Huai You,Li Yan Yuan,et al. the loop formula based semantics of description logic programs[J]. Theoretical Computer Science,2011,415:-. |
| APA | Yisong Wang,Jia-Huai You,Li Yan Yuan,Yi-Dong Shen,&Mingyi Zhang.(2011).the loop formula based semantics of description logic programs.Theoretical Computer Science,415,-. |
| MLA | Yisong Wang,et al."the loop formula based semantics of description logic programs".Theoretical Computer Science 415(2011):-. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。