Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

LPNMR
2005
Springer

favoriteEmaildiscussreport

91views Automated Reasoning» more LPNMR 2005»

On Modular Translations and Strong Equivalence

13 years 10 months ago

On Modular Translations and Strong Equivalence

Download userweb.cs.utexas.edu

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.

Paolo Ferraris

Real-time Traffic

Answer Set Semantics | LPNMR 2005 | Monotone Cardinality Atoms | Sound Wth Respect |

claim paper

Related Content

» On the Strong Normalisation of Natural Deduction with PermutationConversions

» Strong order equivalence

» Monads and Modular Term Rewriting

» Uniform Equivalence of Logic Programs under the Stable Model Semantics

» DelayInsensitivity and SemiModularity

» Alternative Characterizations for Program Equivalence under AnswerSet Semantics Based on U...

» Alternative Characterizations for Program Equivalence under AnswerSet Semantics Preliminar...

» Depth Reduction for Circuits with a Single Layer of Modular Counting Gates

» A Novel Implementation of the FITETRT Translation Method

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	LPNMR
Authors	Paolo Ferraris

Comments (0)