Foundations of logic programming
Foundations of logic programming
The alternating fixpoint of logic programs with negation
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic programs with classical negation
Logic programming
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Well founded semantics for logic programs with explicit negation
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
The limits of fixed-order computation
Theoretical Computer Science
The Description Logic Handbook
The Description Logic Handbook
A Coherent Well-founded Model for Hybrid MKNF Knowledge Bases
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Incremental Answer Completion in the SLG-WAM
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Conjunctive query answering for the description logic SHIQ
Journal of Artificial Intelligence Research
A faithful integration of description logics with logic programming
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Nonmonotonic databases and epistemic queries
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Well-founded semantics for hybrid rules
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Effective integration of declarative rules with external evaluations for semantic-web reasoning
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Towards closed world reasoning in dynamic open worlds
Theory and Practice of Logic Programming
Querying in EL+ with Nonmonotonic Rules
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Hybrid reasoning with non-monotonic rules
ReasoningWeb'10 Proceedings of the 6th international conference on Semantic technologies for software engineering
Local closed world reasoning with description logics under the well-founded semantics
Artificial Intelligence
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Normative systems represented as hybrid knowledge bases
CLIMA'11 Proceedings of the 12th international conference on Computational logic in multi-agent systems
Querying OWL 2 QL and non-monotonic rules
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Implementing query answering for hybrid MKNF knowledge bases
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
A simple and efficient implementation of concurrent local tabling
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Query-Driven Procedures for Hybrid MKNF Knowledge Bases
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.01 |
An important issue for the Semantic Web is how to combine open-world ontology languages with closed-world (non-monotonic) rule paradigms. Several proposals for hybrid languages allow concepts to be simultaneously defined by an ontology and rules, where rules may refer to concepts in the ontology and the ontology may also refer to predicates defined by the rules. Hybrid MKNF knowledge bases are one such proposal, for which both a stable and a well-founded semantics have been defined. The definition of Hybrid MKNF knowledge bases is parametric on the ontology language, in the sense that non-monotonic rules can extend any decidable ontology language. In this paper we define a query-driven procedure for Hybrid MKNF knowledge bases that is sound with respect to the original stable model-based semantics, and is correct with respect to the well-founded semantics. This procedure is able to answer conjunctive queries, and is parametric on an inference engine for reasoning in the on- tology language. Our procedure is based on an extension of a tabled rule evaluation to capture reasoning within an ontology by modeling it as an interaction with an external oracle and, with some assumptions on the complexity of the oracle compared to the complexity of the ontology language, maintains the data complexity of the well-founded semantics for hybrid MKNF knowledge bases.