Discovering classes of strongly equivalent logic programs
From MaRDI portal
Recommendations
Cited in
(17)- Hyperequivalence of logic programs with respect to supported models
- Characterizing causal action theories and their implementations in answer set programming
- Solving logic program conflict through strong and weak forgettings
- Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
- Discovering theorems in game theory: two-person games with unique pure Nash equilibrium payoffs
- Computing loops with at most one external support rule for disjunctive logic programs
- Epistemic logic programs: a different world view
- On the strong equivalences of \(\mathrm{LP}^\mathrm{MLN}\) programs
- Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective
- On uniform equivalence of epistemic logic programs
- Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
- Strongly equivalent logic programs
- On the strong equivalences for \(\mathrm{LP^{MLN}}\) programs
- Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
- On dynamics in structured argumentation formalisms
- On Heuer's procedure for verifying strong equivalence
- Equivalence for the G₃^-stable models semantics
This page was built for publication: Discovering classes of strongly equivalent logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624060)
