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

DOI10.1007/s10472-007-9049-2zbMath1118.68161MaRDI QIDQ2642629

Miroslaw Truszczynski

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

Default logic; Autoepistemic logic; Nonmonotonic theories

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

06B23: Complete lattices, completions

Related Items

Algebraic semantics for modal and superintuitionistic non-monotonic logics, Open Problems in Abstract Argumentation, Characterizing strong equivalence for argumentation frameworks, Equilibrium logic, Equivalence for the \(G_3^\prime\)-stable models semantics, 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A logic for default reasoning
• Fixpoint semantics for logic programming a survey
• Uniform semantic treatment of default and autoepistemic logics
• Nested expressions in logic programs
• A lattice-theoretical fixpoint theorem and its applications
• A kripke-kleene semantics for logic programs*
• Bilattices and the semantics of logic programming
• The Semantics of Predicate Logic as a Programming Language
• Strong equivalence made easy: nested expressions and weight constraints
• Logic Programming
• Semantical characterizations and complexity of equivalences in answer set programming
• Logic Programming
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Strongly equivalent logic programs