Characterization of strongly equivalent logic programs in intermediate logics
From MaRDI portal
Publication:4452594
DOI10.1017/S147106840200159XzbMATH Open1069.68538OpenAlexW2090184124MaRDI QIDQ4452594FDOQ4452594
Authors: Alex Hendriks, Dick H. J. de Jongh
Publication date: 1 March 2004
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s147106840200159x
Recommendations
Cited In (18)
- Rule Calculus: Semantics, Axioms and Applications
- Strongly equivalent logic programs
- Relativized hyperequivalence of logic programs for modular programming
- Equilibrium logic
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- Synonymous theories and knowledge representations in answer set programming
- Equivalence for the \(G_3^\prime\)-stable models semantics
- From answer set logic programming to circumscription via logic of GK
- An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms
- A first order nonmonotonic extension of constructive logic
- Relativized Hyperequivalence of Logic Programs for Modular Programming
- Notes on my scientific life
- Hyperequivalence of logic programs with respect to supported models
- Cut-free formulations for a quantified logic of here and there
- Here and there among logics for logic programming
- On Heuer's procedure for verifying strong equivalence
- Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
- Strong Negation and Equivalence in the Safe Belief Semantics
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)