Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound with respect to the answer set semantics. The main theorem of this paper characterizes the existence of such a translation in terms of strong equivalence. The theorem is used to study the expressiveness of several classes of programs, including the comparison of cardinality constraints with monotone cardinality atoms.

PDF, PS

In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), pp. 79-91 2005.

@inproceedings{fer05d, title={On Modular Translations and Strong Equivalence}, author={Paolo Ferraris}, booktitle={Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)}, pages={79-91}, url="http://www.cs.utexas.edu/users/ai-lab?fer05d", year={2005} }