Model-based recasting in answer-set programming
From MaRDI portal
Publication:4583308
Recommendations
- Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
- A common view on strong, uniform, and other notions of equivalence in answer-set programming
- scientific article; zbMATH DE number 2090116
- Strongly equivalent logic programs
- Equivalence between answer-set programs under (partially) fixed input
Cites work
- scientific article; zbMATH DE number 5910656 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 25192 (Why is no real title available?)
- scientific article; zbMATH DE number 2085248 (Why is no real title available?)
- scientific article; zbMATH DE number 2090542 (Why is no real title available?)
- A Characterization of Strong Equivalence for Logic Programs with Variables
- A common view on strong, uniform, and other notions of equivalence in answer-set programming
- A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there
- A logic for default reasoning
- A logical semantics for description logic programs
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence
- Equilibrium logic
- Hyperequivalence of logic programs with respect to supported models
- Logic Programming
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Logics in Artificial Intelligence
- Logics in Artificial Intelligence
- Program Correspondence under the Answer-Set Semantics: The Non-ground Case
- Propositional semantics for disjunctive logic programs
- Propositional theories are strongly equivalent to logic programs
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Relativized hyperequivalence of logic programs for modular programming
- Semantical characterizations and complexity of equivalences in answer set programming
- Stable inference as intuitionistic validity
- Static analysis in Datalog extensions
- Strongly equivalent logic programs
- The decision problem for some classes of sentences without quantifiers
- Tight logic programs
Cited in
(12)- Relating two dialects of answer set programming
- scientific article; zbMATH DE number 2090116 (Why is no real title available?)
- Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
- Realizability of three-valued semantics for abstract dialectical frameworks
- Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence
- A denotational semantics for equilibrium logic
- scientific article; zbMATH DE number 7453102 (Why is no real title available?)
- Static and dynamic orderings on Dungean argumentation frameworks -- an overview
- On uniform equivalence of epistemic logic programs
- Termination of grounding is not preserved by strongly equivalent transformations
- Equivalence between answer-set programs under (partially) fixed input
- Dual-normal logic programs -- the forgotten class
This page was built for publication: Model-based recasting in answer-set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4583308)
