A common view on strong, uniform, and other notions of equivalence in answer-set programming
From MaRDI portal
Publication:5451973
DOI10.1017/S1471068407003250zbMath1140.68360MaRDI QIDQ5451973
Publication date: 27 March 2008
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Related Items (20)
An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms ⋮ Applying Visible Strong Equivalence in Answer-Set Program Transformations ⋮ Characterising equilibrium logic and nested logic programs: Reductions and complexity, ⋮ Belief Base Change Operations for Answer Set Programming ⋮ Model-based recasting in answer-set programming ⋮ Reasoning on with Defeasibility in ASP ⋮ Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs ⋮ A denotational semantics for equilibrium logic ⋮ Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs ⋮ Characterizing strong equivalence for argumentation frameworks ⋮ On graph equivalences preserved under extensions ⋮ Equivalence between answer-set programs under (partially) fixed input ⋮ Inlining External Sources in Answer Set Programs ⋮ Abstraction for non-ground answer set programs ⋮ Answer Set Programming: A Primer ⋮ Hyperequivalence of logic programs with respect to supported models ⋮ Relativized hyperequivalence of logic programs for modular programming ⋮ Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There ⋮ Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence ⋮ Relativized Hyperequivalence of Logic Programs for Modular Programming
This page was built for publication: A common view on strong, uniform, and other notions of equivalence in answer-set programming
