I am grateful to the anonymous reviewers for suggestions to improve this article. This work was supported by the Austrian Science Fund (FWF) under grants P18019 and P20841, and by the Vienna Science and Technology Fund (WWTF) under project ICT08-020.

## References

BARAL, C. 2003. *Knowledge Representation, Reasoning and Declarative Problem Solving*. Cambridge University Press, Cambridge.

CABALAR, P. AND FERRARIS, P. 2007. Propositional theories are strongly equivalent to logic programs. *Theory and Practice of Logic Programming 7,* 6 (Nov.), 745–759.

CABALAR, P., PEARCE, D., AND VALVERDE, A. 2007. Minimal logic programs. In *ICLP*, V. Dahl and I. Niemel¨a, Eds. Lecture Notes in Computer Science, vol. 4670. Springer, 104–118.

DAO-TRAN, M., EITER, T., FINK, M., AND KRENNWALLNER, T. 2009. Modular nonmonotonic logic programming revisited. In *ICLP*, P. M. Hill and D. S. Warren, Eds. Lecture Notes in Computer Science, vol. 5649. Springer, 145–159.

DE BRUIJN, J., PEARCE, D., POLLERES, A., AND VALVERDE, A. 2007. Quantified equilibrium logic and hybrid rules. In RR, M. Marchiori, J. Z. Pan, and C. de Sainte Marie, Eds. Lecture Notes in Computer Science, vol. 4524. Springer, 58–72.

EITER, T. AND FINK, M. 2003. Uniform equivalence of logic programs under the stable model semantics. In *ICLP*, C. Palamidessi, Ed. Lecture Notes in Computer Science, vol. 2916. Springer, 224–238.

EITER, T., FINK, M., TOMPITS, H., TRAXLER, P., AND WOLTRAN, S. 2006. Replacements in non-ground answer-set programming. In KR, P. Doherty, J. Mylopoulos, and C. A. Welty, Eds.

AAAI Press, 340–351.

EITER, T., FINK, M., TOMPITS, H., AND WOLTRAN, S. 2005. Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case.

In *AAAI*, M. M. Veloso and S. Kambhampati, Eds. AAAI Press, 695–700.

EITER, T., FINK, M., TOMPITS, H., AND WOLTRAN, S. 2007. Complexity results for checking equivalence of stratified logic programs. In *IJCAI*, M. M. Veloso, Ed., 330–335.

EITER, T., FINK, M., AND WOLTRAN, S. 2007. Semantical characterizations and complexity of equivalences in answer set programming. *ACM Trans. Comput. Log. 8,* 3.

EITER, T., TOMPITS, H., AND WOLTRAN, S. 2005. On solution correspondences in answer-set programming. In *IJCAI*, L. P. Kaelbling and A. Saffiotti, Eds. Professional Book Center, 97–102.

FABER, W. AND KONCZAK, K. 2006. Strong order equivalence. *Ann. Math. Artif. Intell. 47,* 1-2, 43–78.

FABER, W., TOMPITS, H., AND WOLTRAN, S. 2008. Notions of strong equivalence for logic programs with ordered disjunction. In KR, G. Brewka and J. Lang, Eds. AAAI Press, 433–443.

FERRARIS, P., LEE, J., AND LIFSCHITZ, V. 2007. A new perspective on stable models. In *IJCAI*,
M. M. Veloso, Ed., 372–379.

FINK, M. 2008. Equivalences in answer-set programming by countermodels in the logic of hereand-there. In *ICLP*, M. G. de la Banda and E. Pontelli, Eds. Lecture Notes in Computer Science, vol. 5366. Springer, 99–113.

FINK, M. 2009. On Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There. Tech. Rep. INFSYS RR-1843-09-05, Institut f¨ur Informationssysteme, Technische Universit¨at Wien, Austria.

FINK, M. AND PEARCE, D. 2009. Some equivalence concepts for hybrid theories. In *CAEPIA*.

Spanish Association for Artifical Intelligence, 327–336.