Characterization of strongly equivalent logic programs in intermediate logics
From MaRDI portal
Publication:4452594
Recommendations
Cited in
(18)- An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms
- Hyperequivalence of logic programs with respect to supported models
- A first order nonmonotonic extension of constructive logic
- Notes on my scientific life
- On Heuer's procedure for verifying strong equivalence
- Synonymous theories and knowledge representations in answer set programming
- From answer set logic programming to circumscription via logic of GK
- Strongly equivalent logic programs
- Equivalence for the \(G_3^\prime\)-stable models semantics
- Relativized hyperequivalence of logic programs for modular programming
- Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
- Relativized Hyperequivalence of Logic Programs for Modular Programming
- Strong Negation and Equivalence in the Safe Belief Semantics
- Equilibrium logic
- Here and there among logics for logic programming
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- Cut-free formulations for a quantified logic of here and there
- Rule Calculus: Semantics, Axioms and Applications
This page was built for publication: Characterization of strongly equivalent logic programs in intermediate logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452594)