Strong equivalence made easy: nested expressions and weight constraints

DOI10.1017/S1471068403001819zbMath1079.68017MaRDI QIDQ4815035

Hudson Turner

Publication date: 19 August 2004

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

answer sets; strong equivalence; nested expressions; weight constraints.

Mathematics Subject Classification ID

68Q55: Semantics in the theory of computing

68N17: Logic programming

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, Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs, 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, Characterising equilibrium logic and nested logic programs: Reductions and complexity,, On Negative Unfolding in the Answer Set Semantics, Merging Belief Bases Represented by Logic Programs, Some (in)translatability results for normal logic programs and propositional theories, Relativized hyperequivalence of logic programs for modular programming

Uses Software

• Smodels