Extending logic programs with description logic expressions for the semantic web
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
The loop formula based semantics of description logic programs
Theoretical Computer Science
Tightly integrated probabilistic description logic programs for representing ontology mappings
Annals of Mathematics and Artificial Intelligence
Uniform evaluation of nonmonotonic DL-Programs
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
A general Datalog-based framework for tractable query answering over ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Well-supported semantics for description logic programs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Semantic independence in DL-programs
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
On integrating description logics and rules under minimal hypotheses
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
RDL: enhancing description logic with rules
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Query-Driven Procedures for Hybrid MKNF Knowledge Bases
ACM Transactions on Computational Logic (TOCL)
Data repair of inconsistent DL-programs
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
We present a novel combination of disjunctive programs under the answer set semantics with description logics for the Semantic Web. The combination is based on a well-balanced interface between disjunctive programs and description logics, which guarantees the decidability of the resulting formalism without assuming syntactic restrictions. We show that the new formalism has very nice semantic properties. In particular, it faithfully extends both disjunctive programs and description logics. Furthermore, we describe algorithms for reasoning in the new formalism, and we give a precise picture of its computational complexity. We also define the well-founded semantics for the normal case, where normal programs are combined with tractable description logics, and we explore its semantic and computational properties. In particular, we show that the well-founded semantics approximates the answer set semantics. We also describe algorithms for the problems of consistency checking and literal entailment under the well-founded semantics, and we give a precise picture of their computational complexity. As a crucial property, in the normal case, consistency checking and literal entailment under the well-founded semantics are both tractable in the data complexity, and even first-order rewritable (and thus can be done in LogSpace in the data complexity) in a special case that is especially useful for representing mappings between ontologies.