PUHRER ¨ , J. AND TOMPITS, H. 2009. Casting away disjunction and negation under a generalisation of strong equivalence with projection. In *LPNMR*, E. Erdem, F. Lin, and T. Schaub, Eds. Lecture Notes in Computer Science, vol. 5753. Springer, 264–276.

PUHRER ¨ , J., TOMPITS, H., AND WOLTRAN, S. 2008. Elimination of disjunction and negation in answer-set programs under hyperequivalence. In *ICLP*, M. G. de la Banda and E. Pontelli, Eds. Lecture Notes in Computer Science, vol. 5366. Springer, 561–575.

SAKAMA, C. AND INOUE, K. 2009. Equivalence issues in abduction and induction. J. Applied Logic 7, 3, 318–328.

SIMONS, P., NIEMELA¨ , I., AND SOININEN, T. 2002. Extending and Implementing the Stable Model Semantics. *Artificial Intelligence 138*, 181–234.

TRUSZCZYNSKI, M. AND WOLTRAN, S. 2008a. Hyperequivalence of logic programs with respect to supported models. *Ann. Math. Artif. Intell. 53,* 1-4, 331–365.

TRUSZCZYNSKI, M. AND WOLTRAN, S. 2008b. Relativized hyperequivalence of logic programs for modular programming. In *ICLP*, M. G. de la Banda and E. Pontelli, Eds. Lecture Notes in Computer Science, vol. 5366. Springer, 576–590.

WOLTRAN, S. 2008. A common view on strong, uniform, and other notions of equivalence in answer-set programming. *Theory and Practice of Logic Programming 8,* 2 (Mar.), 217–234.