First-Order Disjunctive Logic Programming vs Normal Logic Programming

In this paper, we study the expressive power of first-order disjunctive logic programming (DLP) and normal logic programming (NLP) under the stable model semantics. We show that, unlike the propositional case, first-order DLP is strictly more expressive than NLP. This result still holds even if auxiliary predicates are allowed, assuming NP ≠ coNP. On the other side, we propose a partial translation from first-order DLP to NLP via unfolding and shifting, which suggests a sound yet incomplete approach to implement DLP via NLP solvers. We also identify some NLP definable subclasses, and conjecture to exactly capture NLP definability by unfolding and shifting.

[1]  Yi Zhou,et al.  From Answer Set Logic Programming to Circumscription via Logic of GK , 2007, IJCAI.

[2]  Rina Dechter,et al.  Propositional semantics for disjunctive logic programs , 1994, Annals of Mathematics and Artificial Intelligence.

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

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

[5]  John S. Schlipf,et al.  The Expressive Powers of the Logic Programming Semantics , 1995, J. Comput. Syst. Sci..

[6]  Yi Zhou.  From Disjunctive to Normal Logic Programs via Unfolding and Shifting , 2014, ECAI.

[7]  Joohyung Lee,et al.  Functional Stable Model Semantics and Answer Set Programming Modulo Theories , 2013, IJCAI.

[8]  Georg Gottlob,et al.  Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics , 1994, IS/KI.

[9]  Yi Zhou,et al.  Ordered completion for first-order logic programs on finite structures , 2010, Artif. Intell..

[10]  Yuri Gurevich,et al.  Datalog vs First-Order Logic , 1994, J. Comput. Syst. Sci..

[11]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[12]  Victor W. Marek,et al.  The Logic Programming Paradigm: A 25-Year Perspective , 2011 .

[13]  Joohyung Lee,et al.  First-Order Extension of the FLP Stable Model Semantics via Modified Circumscription , 2011, IJCAI.

[14]  Domenico Saccà,et al.  The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries , 1997, J. Comput. Syst. Sci..

[15]  Jürgen Dix,et al.  Semantics of (disjunctive) Logic Programs Based on Partial Evaluation , 1999, J. Log. Program..

[16]  Ding‐Zhu Du,et al.  Wiley Series in Discrete Mathematics and Optimization , 2014 .

[17]  Yan Zhang,et al.  Ordered completion for logic programs with aggregates , 2015, Artif. Intell..

[18]  Yi Zhou,et al.  Progression Semantics for Disjunctive Logic Programs , 2011, AAAI.

[19]  Martin Gebser,et al.  Answer Set Solving in Practice , 2012, Answer Set Solving in Practice.

[20]  Vladimir Lifschitz,et al.  Logic Programs with Intensional Functions , 2012, KR.

[21]  Stefan Woltran,et al.  On Eliminating Disjunctions in Stable Logic Programming , 2004, KR.

[22]  Joohyung Lee,et al.  Stable models and circumscription , 2011, Artif. Intell..

[23]  Victor W. Marek,et al.  On the expressibility of stable logic programming , 2001, Theory and Practice of Logic Programming.

[24]  Chiaki Sakama,et al.  Partial Deduction in Disjunctive Logic Programming , 1997, J. Log. Program..

[25]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[26]  Joohyung Lee,et al.  First-Order Stable Model Semantics and First-Order Loop Formulas , 2011, J. Artif. Intell. Res..

[27]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

[28]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.

[29]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[30]  Fangzhen Lin,et al.  First-Order Loop Formulas for Normal Logic Programs , 2006, KR.

[31]  Thomas Eiter,et al.  Answer Set Programming for the Semantic Web , 2007, ICLP.

[32]  Miroslaw Truszczynski,et al.  A Tarskian Informal Semantics for Answer Set Programming , 2012, ICLP.

[33]  Yan Zhang,et al.  On the Progression Semantics and Boundedness of Answer Set Programs , 2010, KR.

[34]  David Pearce,et al.  Towards a First Order Equilibrium Logic for Nonmonotonic Reasoning , 2004, JELIA.

[35]  Kewen Wang,et al.  FLP answer set semantics without circular justifications for general logic programs , 2014, Artif. Intell..

[36]  Miroslaw Truszczynski,et al.  Disjective Defaults , 1991, KR.