On graph equivalences preserved under extensions

Bratko, 2001 Colbourn, 1987 Diestel, 2000 Eiter, 2007, Semantical characterizations and complexity of equivalences in answer set programming, ACM Transactions on Computational Logic, 8, 53, 10.1145/1243996.1244000 Garey, 1979 Lifschitz, 2001, Strongly equivalent logic programs, ACM Transactions on Computational Logic, 2, 526, 10.1145/383779.383783 Oikarinen, 2010, Characterizing strong equivalence for argumentation frameworks, 123 Turner, 2003, Strong equivalence made easy: nested expressions and weight constraints, Theory and Practice of Logic Programming, 3, 609, 10.1017/S1471068403001819 Woltran, 2008, A common view on strong, uniform, and other notions of equivalence in answer-set programming, Theory and Practice of Logic Programming, 8, 217, 10.1017/S1471068407003250