On Modular Translations and Strong Equivalence

Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth 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.

• Type: Conference
• Year: 2005
• Where: LPNMR
• Authors: Paolo Ferraris
• Keywords: Answer Set Semantics, LPNMR 2005, Monotone Cardinality Atoms, Sound Wth Respect