Strong equivalence made easy: nested expressions and weight constraints
From MaRDI portal
Publication:4815035
DOI10.1017/S1471068403001819zbMath1079.68017OpenAlexW2066287719MaRDI QIDQ4815035
Publication date: 19 August 2004
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068403001819
Related Items (38)
Merging existential rules programs in multi-agent contexts through credibility accrual ⋮ Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version ⋮ Applying Visible Strong Equivalence in Answer-Set Program Transformations ⋮ Default Negation as Explicit Negation plus Update ⋮ Characterising equilibrium logic and nested logic programs: Reductions and complexity, ⋮ A Unifying Perspective on Knowledge Updates ⋮ Strong order equivalence ⋮ Equilibrium logic ⋮ Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach ⋮ The rise and fall of semantic rule updates based onSE-models ⋮ Rewriting recursive aggregates in answer set programming: back to monotonicity ⋮ Characterization of logic program revision as an extension of propositional revision ⋮ Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs ⋮ On Uniform Equivalence of Epistemic Logic Programs ⋮ Inductive equivalence in clausal logic and nonmonotonic logic programming ⋮ Logic programming as classical inference ⋮ Complexity results for answer set programming with bounded predicate arities and implications ⋮ On updates of hybrid knowledge bases composed of ontologies and rules ⋮ Unnamed Item ⋮ Merging Logic Programs under Answer Set Semantics ⋮ On graph equivalences preserved under extensions ⋮ Cumulativity Tailored for Nonmonotonic Reasoning ⋮ Equivalence between answer-set programs under (partially) fixed input ⋮ Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets ⋮ Multi-source multiple change on belief bases ⋮ Omission-Based Abstraction for Answer Set Programs ⋮ On Negative Unfolding in the Answer Set Semantics ⋮ Abstraction for non-ground answer set programs ⋮ Merging Belief Bases Represented by Logic Programs ⋮ Hyperequivalence of logic programs with respect to supported models ⋮ Some (in)translatability results for normal logic programs and propositional theories ⋮ Relativized hyperequivalence of logic programs for modular programming ⋮ 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 ⋮ Possibilistic nested logic programs and strong equivalence ⋮ Semi-equilibrium models for paracoherent answer set programs ⋮ Construction of system of spheres-based transitively relational partial meet multiple contractions: an impossibility result
Uses Software
This page was built for publication: Strong equivalence made easy: nested expressions and weight constraints
