A common view on strong, uniform, and other notions of equivalence in answer-set programming
From MaRDI portal
Publication:5451973
DOI10.1017/S1471068407003250zbMATH Open1140.68360MaRDI QIDQ5451973FDOQ5451973
Publication date: 27 March 2008
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Recommendations
- On strong equivalence theorem for answer set semantics with strong negation
- scientific article; zbMATH DE number 2090116
- Logics in Artificial Intelligence
- Semantical characterizations and complexity of equivalences in answer set programming
- Logic Programming
- Equivalence Between Answer-Set Programs Under (Partially) Fixed Input
- Equivalence between answer-set programs under (partially) fixed input
- Logic Programming and Nonmonotonic Reasoning
- Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
Cited In (22)
- Logic Programming
- Inlining External Sources in Answer Set Programs
- Model-based recasting in answer-set programming
- Relativized hyperequivalence of logic programs for modular programming
- Applying Visible Strong Equivalence in Answer-Set Program Transformations
- Answer Set Programming: A Primer
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- On graph equivalences preserved under extensions
- Abstraction for non-ground answer set programs
- Belief Base Change Operations for Answer Set Programming
- An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Characterizing strong equivalence for argumentation frameworks
- Reasoning on with Defeasibility in ASP
- Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence
- A denotational semantics for equilibrium logic
- Relativized Hyperequivalence of Logic Programs for Modular Programming
- Equivalence between answer-set programs under (partially) fixed input
- Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
- Hyperequivalence of logic programs with respect to supported models
- Equivalence Between Answer-Set Programs Under (Partially) Fixed Input
- Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
This page was built for publication: A common view on strong, uniform, and other notions of equivalence in answer-set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451973)
