Notions of Strong Equivalence for Logic Programs with Ordered Disjunction

Ordered disjunctions have been introduced as a simple, yet expressive approach for representing preferential knowledge by means of logic programs. The semantics for the resulting language is based on the answer-set semantics, but comes in different variants, depending on the particular interpretation of preference aggregation associated to the ordered disjunction connective. While in standard answer-set programming the question of when a program is to be considered equivalent to another received increasing attention in recent years, this problem has not been addressed for programs with ordered disjunctions so far. In this paper, we discuss the concept of strong equivalence in this setting. We introduce different versions of strong equivalence for programs with ordered disjunctions and provide model-theoretic characterisations, extending well-known ones for strong equivalence between ordinary logic programs. Furthermore, we discuss the relationships between the proposed notions and study their computational complexity.

[1]  Elisa Bertino,et al.  PDL with preferences , 2005, Sixth IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'05).

[2]  Hans Tompits,et al.  A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning , 2004, Comput. Intell..

[3]  Fangzhen Lin.  Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic , 2002, KR.

[4]  Marcello Balduccini,et al.  CR-Prolog with Ordered Disjunction , 2003, Answer Set Programming.

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

[6]  Norman Y. Foo,et al.  LPOD Answer Sets and Nash Equilibria , 2004, ASIAN.

[7]  David Pearce,et al.  Minimal Logic Programs , 2007, ICLP.

[8]  Wolfgang Faber,et al.  Strong order equivalence , 2006, Annals of Mathematics and Artificial Intelligence.

[9]  Christine Solnon,et al.  Applications of Preferences using Answer Set Programming , 2005, Answer Set Programming.

[10]  Ilkka Niemelä,et al.  Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs , 2002, JELIA.

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

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

[13]  Gerhard Brewka,et al.  Logic programming with ordered disjunction , 2002, NMR.

[14]  Alex M. Andrew,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2004 .

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

[16]  Stefan Woltran,et al.  Simplifying Logic Programs Under Uniform and Strong Equivalence , 2004, LPNMR.

[17]  Hudson Turner,et al.  Strong equivalence made easy: nested expressions and weight constraints , 2003, Theory and Practice of Logic Programming.

[18]  Ilkka Niemelä,et al.  Logic Programs with Ordered Disjunction , 2004, Comput. Intell..