Strong equivalence made easy: nested expressions and weight constraints
From MaRDI portal
Publication:4815035
DOI10.1017/S1471068403001819zbMATH Open1079.68017OpenAlexW2066287719MaRDI QIDQ4815035FDOQ4815035
Authors: Hudson Turner 
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
Recommendations
Cited In (55)
- Construction of system of spheres-based transitively relational partial meet multiple contractions: an impossibility result
- Semi-equilibrium models for paracoherent answer set programs
- Merging Logic Programs under Answer Set Semantics
- A Unifying Perspective on Knowledge Updates
- Program Correspondence under the Answer-Set Semantics: The Non-ground Case
- Default Negation as Explicit Negation plus Update
- Relativized hyperequivalence of logic programs for modular programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Possibilistic nested logic programs and strong equivalence
- Some (in)translatability results for normal logic programs and propositional theories
- Equilibrium logic
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- Inductive equivalence in clausal logic and nonmonotonic logic programming
- A Characterization of Strong Equivalence for Logic Programs with Variables
- On graph equivalences preserved under extensions
- Abstraction for non-ground answer set programs
- Merging Belief Bases Represented by Logic Programs
- Merging existential rules programs in multi-agent contexts through credibility accrual
- Strong order equivalence
- Multi-source multiple change on belief bases
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version
- Strongly Equivalent Temporal Logic Programs
- Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence
- Main issues in belief revision, belief merging and information fusion
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Title not available (Why is that?)
- Cumulativity Tailored for Nonmonotonic Reasoning
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- Characterization of logic program revision as an extension of propositional revision
- Relativized Hyperequivalence of Logic Programs for Modular Programming
- On the strong equivalences for \(\mathrm{LP^{MLN}}\) programs
- On uniform equivalence of epistemic logic programs
- Omission-based abstraction for answer set programs
- Equivalence between answer-set programs under (partially) fixed input
- Propositional theories are strongly equivalent to logic programs
- Logic programming as classical inference
- Applying visible strong equivalence in answer-set program transformations
- On updates of hybrid knowledge bases composed of ontologies and rules
- Hyperequivalence of logic programs with respect to supported models
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
- Title not available (Why is that?)
- The rise and fall of semantic rule updates based on SE-models
- Applying visible strong equivalence in answer-set program transformations
- Strong equivalence of logic programs with abstract constraint atoms
- Weight constraints as nested expressions
- On Negative Unfolding in the Answer Set Semantics
- On Heuer's procedure for verifying strong equivalence
- Rewriting recursive aggregates in answer set programming: back to monotonicity
- Logic Programming and Nonmonotonic Reasoning
- Complexity results for answer set programming with bounded predicate arities and implications
- Characterization of strongly equivalent logic programs in intermediate logics
- Infinitary equilibrium logic and strongly equivalent logic programs
Uses Software
This page was built for publication: Strong equivalence made easy: nested expressions and weight constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4815035)
