Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Conjunctive query answering for the description logic SHIQ
Journal of Artificial Intelligence Research
Nonmonotonic databases and epistemic queries
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Queries to Hybrid MKNF Knowledge Bases through Oracular Tabling
ISWC '09 Proceedings of the 8th International Semantic Web Conference
The DL-lite family and relations
Journal of Artificial Intelligence Research
Reconciling description logics and rules
Journal of the ACM (JACM)
Matching patient records to clinical trials using ontologies
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Querying in EL+ with Nonmonotonic Rules
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Local closed world reasoning with description logics under the well-founded semantics
Artificial Intelligence
Query-Driven Procedures for Hybrid MKNF Knowledge Bases
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Answering (conjunctive) queries is an important reasoning task in Description Logics (DL), hence also in highly expressive ontology languages, such as OWL. Extending such ontology languages with rules, such as those expressible in RIF-Core, and further with nonmonotonic rules, integrating default negation as described in the RIF-FLD, yields an even more expressive language that allows for modeling defaults, exceptions, and integrity constraints. Here, we present a top-down procedure for querying knowledge bases (KB) that combine non-monotonic rules with an ontology in DL-LiteR - the DL underlying the OWL 2 profile OWL 2 QL. This profile aims particularly at answering queries in an efficient way for KB with large ABoxes. Our procedure extends the query-answering facility to KB that also include non-monotonic rules, while maintaining tractability of reasoning (w.r.t. data complexity). We show that the answers are sound and complete w.r.t. the well-founded MKNF model for hybrid MKNF KB K.