Abstract
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. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Ferraris, P. (2005). On modular translations and strong equivalence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3662 LNAI, pp. 79–91). https://doi.org/10.1007/11546207_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
