Local closed world reasoning with description logics under the well-founded semantics

An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One of the most mature proposals for this combination is known as hybrid MKNF knowledge bases (Motik and Rosati, 2010 [52]), and it is based on an adaptation of the Stable Model Semantics to knowledge bases consisting of ontology axioms and rules. In this paper we propose a well-founded semantics for nondisjunctive hybrid MKNF knowledge bases that promises to provide better efficiency of reasoning, and that is compatible with both the OWL-based semantics and the traditional Well-Founded Semantics for logic programs. Moreover, our proposal allows for the detection of inconsistencies, possibly occurring in tightly integrated ontology axioms and rules, with only little additional effort. We also identify tractable fragments of the resulting language.

[1]  Pascal Hitzler,et al.  A Preferential Tableaux Calculus for Circumscriptive ALCO , 2009 .

[2]  Sebastian Rudolph,et al.  Description Logic Rules , 2010, ECAI.

[3]  K. A. Ross,et al.  Tabled Evaluation with Delaying for General Logic Programs , 1996 .

[4]  Thomas Eiter,et al.  Rules and Ontologies for the Semantic Web , 2008, Reasoning Web.

[6]  Steffen Staab,et al.  International Handbooks on Information Systems , 2013 .

[7]  B. Motik,et al.  Closing Semantic Web Ontologies , 2006 .

[8]  Pascal Hitzler,et al.  Semantic Matchmaking of Web Resources with Local Closed-World Reasoning , 2007, Int. J. Electron. Commer..

[9]  Francesco M. Donini,et al.  AL-log: Integrating Datalog and Description Logics , 1998, Journal of Intelligent Information Systems.

[10]  Franz Baader,et al.  Embedding defaults into terminological knowledge representation formalisms , 1995, Journal of Automated Reasoning.

[11]  Riccardo Rosati,et al.  DL+log: Tight Integration of Description Logics and Disjunctive Datalog , 2006, KR.

[12]  Thomas Lukasiewicz,et al.  Well-founded semantics for description logic programs in the semantic web , 2004, TOCL.

[13]  Ian Horrocks,et al.  A proposal for an owl rules language , 2004, WWW '04.

[14]  Hans Tompits,et al.  Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning , 2006, ESWC.

[15]  Allen Van Gelder,et al.  The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..

[16]  Carsten Lutz,et al.  Expressive Non-Monotonic Description Logics Based on Circumscription , 2006, KR 2006.

[17]  Riccardo Rosati,et al.  On the decidability and complexity of integrating ontologies and rules , 2005, J. Web Semant..

[18]  Raymond Reiter,et al.  What should a database know? , 1988, PODS '88.

[19]  Pascal Hitzler,et al.  A uniform approach to logic programming semantics , 2002, Theory and Practice of Logic Programming.

[20]  Boris Motik,et al.  Data Complexity of Reasoning in Very Expressive Description Logics , 2005, IJCAI.

[21]  Sebastian Rudolph,et al.  ELP: Tractable Rules for OWL 2 , 2008, SEMWEB.

[22]  Pascal Hitzler,et al.  A better uncle for OWL: nominal schemas for integrating rules and ontologies , 2011, WWW.

[23]  José Júlio Alferes,et al.  Progress in Artificial Intelligence , 2003, Lecture Notes in Computer Science.

[24]  Boris Motik,et al.  Can OWL and Logic Programming Live Together Happily Ever After? , 2006, International Semantic Web Conference.

[25]  Boris Motik,et al.  Reconciling description logics and rules , 2010, JACM.

[26]  José Júlio Alferes,et al.  Queries to Hybrid MKNF Knowledge Bases through Oracular Tabling , 2009, International Semantic Web Conference.

[27]  Ulrike Sattler,et al.  Next Steps for Description Logics of Minimal Knowledge and Negation as Failure , 2008, Description Logics.

[28]  José Júlio Alferes,et al.  Querying in [Escr ][Lscr ]+ with Nonmonotonic Rules , 2010, ECAI.

[29]  Pascal Hitzler,et al.  Defeasible Inference with Circumscriptive OWL Ontologies , 2008 .

[30]  Wlodzimierz Drabent,et al.  Well-Founded Semantics for Hybrid Rules , 2007, RR.

[31]  Jos de Bruijn,et al.  Embedding nonground logic programs into autoepistemic logic for knowledge-base combination , 2007, TOCL.

[32]  Stijn Heymans,et al.  Open answer set programming for the semantic web , 2007, J. Appl. Log..

[33]  Stijn Heymans,et al.  Hybrid Reasoning with Forest Logic Programs , 2009, ESWC.

[34]  Neil Immerman,et al.  Descriptive Complexity and Finite Models , 1997 .

[35]  Pascal Hitzler,et al.  A Preferential Tableaux Calculus for Circumscriptive ALCO{\mathcal ALCO} , 2009, RR.

[36]  Thomas Lukasiewicz,et al.  A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web , 2007, IEEE Transactions on Knowledge and Data Engineering.

[37]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[38]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

[39]  Matthias Knorr,et al.  A Comparison of Disjunctive Well-founded Semantics , 2007, FAInt.

[40]  Raymond Reiter.  What Should a Database Know? , 1992, J. Log. Program..

[41]  Markus Krötzsch.  Efficient Inferencing for OWL EL , 2010, JELIA.

[42]  Ian Horrocks,et al.  Description logic programs: combining logic programs with description logic , 2003, WWW '03.

[43]  Franz Baader,et al.  Pushing the EL Envelope Further , 2008, OWLED.

[44]  José Júlio Alferes,et al.  Well Founded Semantics for Logic Programs with Explicit Negation , 1992, ECAI.

[45]  Ian Horrocks,et al.  The Even More Irresistible SROIQ , 2006, KR.

[46]  Sebastian Rudolph,et al.  Foundations of Semantic Web Technologies , 2009 .

[47]  Peter H. Schmitt,et al.  On the Semantic Relationship between Datalog and Description Logics , 2010, RR.

[48]  Boris Motik,et al.  A Faithful Integration of Description Logics with Logic Programming , 2007, IJCAI.

[49]  Peter F. Patel-Schneider,et al.  OWL 2 Web Ontology Language Primer (Second Edition) , 2012 .

[50]  Pascal Hitzler,et al.  Any-World Access to OWL from Prolog , 2007, KI.

[51]  Edith Schonberg,et al.  Matching Patient Records to Clinical Trials Using Ontologies , 2007, ISWC/ASWC.

[52]  Alon Y. Halevy,et al.  Combining Horn Rules and Description Logics in CARIN , 1998, Artif. Intell..

[53]  José Júlio Alferes,et al.  A Coherent Well-founded Model for Hybrid MKNF Knowledge Bases , 2008, ECAI.

[54]  Boris Motik,et al.  Query Answering for OWL-DL with Rules , 2004, SEMWEB.

[55]  Jos de Bruijn,et al.  Quantified Equilibrium Logic and Hybrid Rules , 2007, RR.

[56]  Vladimir Lifschitz,et al.  Nonmonotonic Databases and Epistemic Queries , 1991, IJCAI.

[57]  Pascal Hitzler,et al.  Ontologies and Rules , 2009, Handbook on Ontologies.

[58]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[59]  José Júlio Alferes,et al.  Towards Tractable Local Closed World Reasoning for the Semantic Web , 2007, EPIA Workshops.

[60]  José Júlio Alferes,et al.  Implementing Query Answering for Hybrid MKNF Knowledge Bases , 2010, PADL.

[61]  Teodor C. Przymusinski.  Stable semantics for disjunctive programs , 1991, New Generation Computing.

[62]  Sebastian Rudolph,et al.  Complexity Boundaries for Horn Description Logics , 2007, AAAI.

[63]  Boris Motik,et al.  Matching Semantic Service Descriptions with Local Closed-World Reasoning , 2006, ESWC.

[64]  José Júlio Alferes,et al.  Querying in EL+ with Nonmonotonic Rules , 2010, ECAI 2010.

[65]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[66]  Hans Tompits,et al.  Combining answer set programming with description logics for the Semantic Web , 2004, Artif. Intell..

[67]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[68]  M. Fitting.  First-order logic and automated theorem proving (2nd ed.) , 1996 .

[69]  Moshe Y. Vardi.  Why is Modal Logic So Robustly Decidable? , 1996, Descriptive Complexity and Finite Models.

[70]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[71]  Francesco M. Donini,et al.  Description logics of minimal knowledge and negation as failure , 2002, TOCL.