Answer-set programming (ASP) has emerged as an important paradigm for declarative problem solving, and provides a host for many different application domains on the basis of nonmonotonic logic programs. The increasing popularity in ASP has raised also the interest in semantic comparisons of programs in ASP [3, 4], which are nowadays recognized as a theoretical basis for program optimization, where equivalencepreserving modifications are of primary interest; in particular, rewriting rules which allow to perform a local change in a program are important. Many such rules have been considered in the propositional setting (cf., e.g., [1, 6]) but just recently have been extended to the practicably important case of non-ground programs [2].
[1]
Mauricio Osorio,et al.
Equivalence in Answer Set Programming
,
2001,
LOPSTR.
[2]
David Pearce,et al.
Strongly equivalent logic programs
,
2001,
ACM Trans. Comput. Log..
[3]
Stefan Woltran,et al.
Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case
,
2005,
AAAI.
[4]
Stefan Woltran,et al.
Replacements in Non-Ground Answer-Set Programming
,
2006,
WLP.
[5]
Jürgen Dix,et al.
Semantics of (disjunctive) Logic Programs Based on Partial Evaluation
,
1999,
J. Log. Program..