Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach

DOI10.1007/S10472-007-9049-2MaRDI QIDQ2642629zbMATH OpenOpenAlexFDO

Authors Mirosław Truszczyński

Publication date 17 August 2007

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10472-007-9049-2

zbMATH Keywords

Autoepistemic logicDefault logicNonmonotonic theories

Mathematics Subject Classification ID

Complete lattices, completions (06B23) Logic in artificial intelligence (68T27)

Recommendations

• Logic Programming
• scientific article; zbMATH DE number 1884383
• Logic Programming and Nonmonotonic Reasoning
• Strongly equivalent logic programs
• Infinitary Equilibrium Logic and Strong Equivalence

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?)
• scientific article; zbMATH DE number 478394 (Why is no real title available?)
• scientific article; zbMATH DE number 1884383 (Why is no real title available?)
• Logic Programming
• Logic Programming
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Nested expressions in logic programs
• Semantical characterizations and complexity of equivalences in answer set programming
• 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)