Dual-normal logic programs – the forgotten class

Disjunctive Answer Set Programming is a powerful declarative programming paradigm with complexity beyond NP. Identifying classes of programs for which the consistency problem is in NP is of interest from the theoretical standpoint and can potentially lead to improvements in the design of answer set programming solvers. One of such classes consists of dual-normal programs , where the number of positive body atoms in proper rules is at most one. Unlike other classes of programs, dual-normal programs have received little attention so far. In this paper we study this class. We relate dual-normal programs to propositional theories and to normal programs by presenting several inter-translations. With the translation from dual-normal to normal programs at hand, we introduce the novel class of body-cycle free programs, which are in many respects dual to head-cycle free programs. We establish the expressive power of dual-normal programs in terms of SE- and UE-models, and compare them to normal programs. We also discuss the complexity of deciding whether dual-normal programs are strongly and uniformly equivalent.

[1]  Stefan Woltran,et al.  Model-based recasting in answer-set programming , 2013, J. Appl. Non Class. Logics.

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

[3]  Stefan Woltran,et al.  Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2 , 2009, Theory and Practice of Logic Programming.

[4]  Georg Gottlob,et al.  On the computational cost of disjunctive logic programming: Propositional case , 1995, Annals of Mathematics and Artificial Intelligence.

[5]  Ilkka Niemelä,et al.  Developing a Declarative Rule Language for Applications in Product Configuration , 1999, PADL.

[6]  F. RICCA,et al.  Team-building with answer set programming in the Gioia-Tauro seaport , 2011, Theory and Practice of Logic Programming.

[7]  Michael Gelfond,et al.  Answer set based design of knowledge systems , 2006, Annals of Mathematics and Artificial Intelligence.

[8]  Kate Saenko,et al.  Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013 , 2013, AAAI 2013.

[9]  Stefan Woltran,et al.  Semantical characterizations and complexity of equivalences in answer set programming , 2005, TOCL.

[10]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

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

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

[13]  Hudson Turner,et al.  Strong Equivalence for Logic Programs and Default Theories (Made Easy) , 2001, LPNMR.

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

[15]  Julio Saez-Rodriguez,et al.  Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming , 2013, Bioinform..

[16]  Miroslaw Truszczynski,et al.  Answer set programming at a glance , 2011, Commun. ACM.

[17]  Thomas Eiter,et al.  Uniform Equivalence of Logic Programs under the Stable Model Semantics , 2003, ICLP.

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

[19]  Tomi Janhunen,et al.  Some (in)translatability results for normal logic programs and propositional theories , 2006, J. Appl. Non Class. Logics.

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

[21]  Miroslaw Truszczynski,et al.  Logic Programming and Nonmotonic Reasoning , 2001, Lecture Notes in Computer Science.

[22]  Stefan Szeider,et al.  Backdoors to Normality for Disjunctive Logic Programs , 2013, AAAI.

[23]  Miroslaw Truszczynski.  Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs , 2011, Theory Pract. Log. Program..

[24]  Michael Gelfond,et al.  An A Prolog decision support system for the Space Shuttle , 2001, Answer Set Programming.

[25]  Jia-Huai You,et al.  Unfolding partiality and disjunctions in stable model semantics , 2000, TOCL.

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