Semantical Characterizations and Complexity of Equivalences in Answer Set Programming

Thomas Eiter, Michael Fink, Stefan Woltran

In recent research on non-monotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P union R and Q unio…