loop formulas for description logic programs
文献类型:会议论文
作者 | Wang Yisong ; You Jia-Huai ; Yuan Li Yan ; Shen Yi-Dong |
出版日期 | 2010 |
会议名称 | 26th International Conference on Logic Programming |
会议日期 | JUL 16-19, |
会议地点 | Edinburgh, SCOTLAND |
关键词 | semantic web description logic programs answer sets loop formulas |
页码 | 531-545 |
英文摘要 | 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. |
会议主办者 | Assoc Log Programming, Execut Comm, Log Programming Comm |
会议录 | Theory and Practice of Logic Programming
![]() |
会议录出版者 | THEORY AND PRACTICE OF LOGIC PROGRAMMING |
会议录出版地 | 32 AVENUE OF THE AMERICAS, NEW YORK, NY 10013-2473 USA |
ISSN号 | 1471-0684 |
WOS记录号 | WOS:000280508200012 |
源URL | [http://124.16.136.157/handle/311060/8816] ![]() |
专题 | 软件研究所_计算机科学国家重点实验室 _会议论文 |
推荐引用方式 GB/T 7714 | Wang Yisong,You Jia-Huai,Yuan Li Yan,et al. loop formulas for description logic programs[C]. 见:26th International Conference on Logic Programming. Edinburgh, SCOTLAND. JUL 16-19,. |
入库方式: OAI收割
来源:软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。