Three-Valued Semantics for Hybrid MKNF Knowledge Bases Revisited (Extended Abstract)

Knorr et al. (2011) formulated a three-valued formalism for the logic of Minimal Knowledge and Negation as Failure (MKNF) and proposed a wellfounded semantics for hybrid MKNF knowledge bases (KBs). The main results state that if a hybrid MKNF KB has a three-valued MKNF model, its well-founded MKNF model exists, which is unique and can be computed by an alternating fixpoint construction. In this paper, we show that these claims are erroneous. We propose a classification of hybrid MKNF KBs into a hierarchy and show that its innermost subclass is what works for the well-founded semantics of Knorr et al. Furthermore, we provide a uniform characterization of well-founded, two-valued, and all three-valued MKNF models, in terms of stable partitions and the alternating fixpoint construction, which leads to updated complexity results as well as proof-theoretic tools for reasoning under these semantics.

[1]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[2]  Carlos Gershenson,et al.  Information and Computation , 2013, Handbook of Human Computation.

[3]  José Júlio Alferes,et al.  Local closed world reasoning with description logics under the well-founded semantics , 2011, Artif. Intell..

[4]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[5]  Ijcai 2007 , 2007, Künstliche Intell..

[6]  Maurice Bruynooghe,et al.  FO(ID) as an extension of DL with rules , 2008, Annals of Mathematics and Artificial Intelligence.

[7]  Victor W. Marek,et al.  Ultimate approximation and its application in nonmonotonic knowledge representation systems , 2004, Inf. Comput..

[8]  Bart Verheij 20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE , 2007, IJCAI 2007.

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

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

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

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

[13]  Federica Mandreoli,et al.  Journal of Computer and System Sciences Special Issue on Query Answering on Graph-Structured Data , 2016, Journal of computer and system sciences (Print).

[14]  Qian Yang,et al.  Integrating Rules and Description Logics by Circumscription , 2011, AAAI.

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