Institutional Repository
| extending logic programs with description logic expressions for the semantic web | |
| Shen Yi-Dong; Wang Kewen | |
| 2011 | |
| Conference Name | 10th International Semantic Web Conference, ISWC 2011 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 633-648 |
| Conference Date | October 23 |
| Conference Place | Bonn, Germany |
| Indexed Type | EI |
| ISSN | 0302-9743 |
| ISBN | 9783642250729 |
| Department | (1) State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China; (2) School of Computing and Information Technology Griffith University Brisbane QLD 4111 Australia |
| English Abstract | 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. |
| Keyword | Atoms Data Description Formal Languages Logic Programming Ontology Semantic Web Semantics User Interfaces |
| Sponsorship | AI Journal; Elsevier; Fluid Operations; OASIS; THESEUS |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16200 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Shen Yi-Dong,Wang Kewen. extending logic programs with description logic expressions for the semantic web[C],2011:633-648. |
| 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