Equivalence in answer set programming
From MaRDI portal
Recommendations
- Strongly equivalent logic programs
- Strong equivalence made easy: nested expressions and weight constraints
- Applying visible strong equivalence in answer-set program transformations
- Applying visible strong equivalence in answer-set program transformations
- Model-based recasting in answer-set programming
Cited in
(34)- Safe beliefs for propositional theories
- Equivalence between answer-set programs under (partially) fixed input
- Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version
- An extension of the stable semantics via Lukasiewicz logic
- Deciding equivalence of separated non-nested attribute systems in polynomial time
- Verifying strong equivalence of programs in the input language of \textsc{gringo}
- Partial equilibrium logic
- Equivalence Between Answer-Set Programs Under (Partially) Fixed Input
- Strong equivalence of RASP programs
- Applying visible strong equivalence in answer-set program transformations
- Termination of grounding is not preserved by strongly equivalent transformations
- Strongly Equivalent Temporal Logic Programs
- Discovering classes of strongly equivalent logic programs
- Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
- Inductive equivalence in clausal logic and nonmonotonic logic programming
- Equivalence and isomorphism for Boolean constraint satisfaction
- Model-based recasting in answer-set programming
- Testing the equivalence of logic programs under stable model semantics
- A logical approach to A-Prolog
- Omission-based abstraction for answer set programs
- On the strong equivalences of \(\mathrm{LP}^\mathrm{MLN}\) programs
- Applying visible strong equivalence in answer-set program transformations
- Semantical characterizations and complexity of equivalences in answer set programming
- Finding similar/diverse solutions in answer set programming
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- A common view on strong, uniform, and other notions of equivalence in answer-set programming
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming
- Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence
- Abstraction for non-ground answer set programs
- Strong order equivalence
- Equilibrium logic
- Equivalence for the G₃^-stable models semantics
This page was built for publication: Equivalence in answer set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808808)
