Semantical considerations on nonmonotonic logic
Artificial Intelligence
Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Combining answer set programming with description logics for the Semantic Web
Artificial Intelligence
Guarded hybrid knowledge bases12
Theory and Practice of Logic Programming
Rules and Ontologies for the Semantic Web
Reasoning Web
Web Semantics: Science, Services and Agents on the World Wide Web
Nonmonotonic databases and epistemic queries
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
A uniform integration of higher-order reasoning and external evaluations in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Reconciling description logics and rules
Journal of the ACM (JACM)
A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web
IEEE Transactions on Knowledge and Data Engineering
Well-supported semantics for description logic programs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Rule revision in normal DL logic programs
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
A rational extension of stable model semantics to the full propositional language
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
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).