Quantified Equilibrium Logic and Hybrid Rules

In the ongoing discussion about combining rules and Ontologies on the Semantic Web a recurring issue is how to combine first-order classical logic with nonmonotonic rule languages. Whereas several modular approaches to define a combined semantics for such hybrid knowledge bases focus mainly on decidability issues, we tackle the matter from a more general point of view. In this paper we show how Quantified Equilibrium Logic (QEL) can function as a unified framework which embraces classical logic as well as disjunctive logic programs under the (open) answer set semantics. In the proposed variant of QEL we relax the unique names assumption, which was present in earlier versions of QEL. Moreover, we show that this framework elegantly captures the existing modular approaches for hybrid knowledge bases in a unified way.

[1]  Dirk van Dalen,et al.  Logic and structure , 1980 .

[2]  Vladimir Lifschitz,et al.  Answer Sets in General Nonmonotonic Reasoning (Preliminary Report) , 1992, KR.

[3]  Jürgen Dix,et al.  Non-Monotonic Extensions of Logic Programming , 1996, Lecture Notes in Computer Science.

[4]  David Pearce,et al.  A New Logical Characterisation of Stable Models and Answer Sets , 1996, NMELP.

[5]  David Pearce,et al.  Strongly equivalent logic programs , 2001, ACM Trans. Comput. Log..

[6]  Davy Van Nieuwenborgh,et al.  G-Hybrid Knowledge Bases , 2003 .

[7]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

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

[9]  Kewen Wang,et al.  Combining Description Logic and Defeasible Logic for the Semantic Web , 2004, RuleML.

[10]  François Fages,et al.  Principles and Practice of Semantic Web Reasoning, Third International Workshop, PPSWR 2005, Dagstuhl Castle, Germany, September 11-16, 2005, Proceedings , 2005, PPSWR.

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

[12]  David Pearce,et al.  A First Order Nonmonotonic Extension of Constructive Logic , 2005, Stud Logica.

[13]  Hans Tompits,et al.  A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming , 2005, IJCAI.

[14]  Riccardo Rosati,et al.  Semantic and Computational Advantages of the Safe Integration of Ontologies and Rules , 2005, PPSWR.

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

[16]  David Pearce,et al.  Equilibrium logic , 2006, Annals of Mathematics and Artificial Intelligence.

[17]  Jos de Bruijn,et al.  On Representational Issues About Combinations of Classical Theories with Nonmonotonic Rules , 2006, KSEM.

[18]  Carsten Lutz,et al.  Did I Damage My Ontology? A Case for Conservative Extensions in Description Logics , 2006, KR.

[19]  Joohyung Lee,et al.  A New Perspective on Stable Models , 2007, IJCAI.

[20]  David Pearce,et al.  A Characterization of Strong Equivalence for Logic Programs with Variables , 2007, LPNMR.

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

[22]  Stijn Heymans,et al.  Open answer set programming with guarded programs , 2006, TOCL.