Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
From MaRDI portal
Publication:2642629
Recommendations
Cites work
- A kripke-kleene semantics for logic programs*
- A lattice-theoretical fixpoint theorem and its applications
- A logic for default reasoning
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- Bilattices and the semantics of logic programming
- Fixpoint semantics for logic programming a survey
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Nested expressions in logic programs
- Nonmonotonic logic. Context-dependent reasoning. Foreword by Ray Reiter
- Semantical characterizations and complexity of equivalences in answer set programming
- Splitting an operator. An algebraic modularity result and its application to logic programming
- Strong equivalence for logic programs and default theories (made easy)
- Strong equivalence made easy: nested expressions and weight constraints
- Strongly equivalent logic programs
- The Semantics of Predicate Logic as a Programming Language
- Uniform semantic treatment of default and autoepistemic logics
Cited in
(19)- Hyperequivalence of logic programs with respect to supported models
- Fixed point semantics for stream reasoning
- An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms
- Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility
- Redundancy in logic. III: Non-monotonic reasoning
- scientific article; zbMATH DE number 4174904 (Why is no real title available?)
- Characterizing strong equivalence for argumentation frameworks
- Algebraic semantics for modal and superintuitionistic non-monotonic logics
- Open problems in abstract argumentation
- An algebraic characterization of equivalent preferential models
- Logic Programming and Nonmonotonic Reasoning
- Static and dynamic orderings on Dungean argumentation frameworks -- an overview
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
- On naive labellings -- realizability, construction and patterns of redundancy
- Fixpoint semantics for recursive \textsc{shacl}
- Non-deterministic approximation operators: ultimate operators, semi-equilibrium semantics, and aggregates
- Approximation fixpoint theory in Coq. With an application to logic programming
- Equilibrium logic
- Equivalence for the G₃^-stable models semantics
This page was built for publication: Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642629)