Strong equivalence made easy: nested expressions and weight constraints
From MaRDI portal
Publication:4815035
DOI10.1017/S1471068403001819zbMath1079.68017MaRDI QIDQ4815035
Publication date: 19 August 2004
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Related Items
Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets, Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence, Relativized Hyperequivalence of Logic Programs for Modular Programming, Program Correspondence under the Answer-Set Semantics: The Non-ground Case, Strong order equivalence, Equilibrium logic, Hyperequivalence of logic programs with respect to supported models, Complexity results for answer set programming with bounded predicate arities and implications, Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach, On Negative Unfolding in the Answer Set Semantics, Merging Belief Bases Represented by Logic Programs
Uses Software