Institutional Repository
| the loop formula based semantics of description logic programs | |
| Yisong Wang; Jia-Huai You; Li Yan Yuan; Yi-Dong Shen; Mingyi Zhang | |
| 2011 | |
| Source | Theoretical Computer Science
 |
| ISSN | 0304-3975 |
| Volume | 415Pages:- |
| English Abstract | 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. |
| Indexed Type | SCIENCEDIRECT ; EI |
| Keyword | Semantic Web Answer Sets Description Logic Programs Loop Formulas |
| Department | aSchool of Computer Science and Information Guizhou University Guiyang 550025 China; bDepartment of Computing Science University of Alberta Edmonton Alberta Canada T6G 2R3; cState Key Laboratory of Computer Science Institute of Software ChineseAcademy of Sciences 100190 China; dGuizhou Academy of Sciences Guiyang 550001 China |
| Language | 英语 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16017 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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):-. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment