extending logic programs with description logic expressions for the semantic web
文献类型：会议论文
| 作者 | Shen Yi-Dong ; Wang Kewen |
| 出版日期 | 2011 |
| 会议名称 | 10th International Semantic Web Conference, ISWC 2011 |
| 会议日期 | October 23 |
| 会议地点 | Bonn, Germany |
| 关键词 | Atoms Data description Formal languages Logic programming Ontology Semantic Web Semantics User interfaces |
| 页码 | 633-648 |
| 中文摘要 | Recently much attention has been directed to extending logic programming with description logic (DL) expressions, so that logic programs have access to DL knowledge bases and thus are able to reason with ontologies in the Semantic Web. In this paper, we propose a new extension of logic programs with DL expressions, called normal DL logic programs. In a normal DL logic program arbitrary DL expressions are allowed to appear in rule bodies and atomic DL expressions (i.e., atomic concepts and atomic roles) allowed in rule heads. We extend the key condition of well-supportedness for normal logic programs under the standard answer set semantics to normal DL logic programs and define an answer set semantics for DL logic programs which satisfies the extended well-supportedness condition. We show that the answer set semantics for normal DL logic programs is decidable if the underlying description logic is decidable (e.g. SHOIN or SROIQ). © 2011 Springer-Verlag. |
| 英文摘要 | Recently much attention has been directed to extending logic programming with description logic (DL) expressions, so that logic programs have access to DL knowledge bases and thus are able to reason with ontologies in the Semantic Web. In this paper, we propose a new extension of logic programs with DL expressions, called normal DL logic programs. In a normal DL logic program arbitrary DL expressions are allowed to appear in rule bodies and atomic DL expressions (i.e., atomic concepts and atomic roles) allowed in rule heads. We extend the key condition of well-supportedness for normal logic programs under the standard answer set semantics to normal DL logic programs and define an answer set semantics for DL logic programs which satisfies the extended well-supportedness condition. We show that the answer set semantics for normal DL logic programs is decidable if the underlying description logic is decidable (e.g. SHOIN or SROIQ). © 2011 Springer-Verlag. |
| 收录类别 | EI |
| 会议主办者 | AI Journal; Elsevier; Fluid Operations; OASIS; THESEUS |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 语种 | 英语 |
| ISSN号 | 0302-9743 |
| ISBN号 | 9783642250729 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16200]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Shen Yi-Dong,Wang Kewen. extending logic programs with description logic expressions for the semantic web[C]. 见:10th International Semantic Web Conference, ISWC 2011. Bonn, Germany. October 23. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。