Uniform semantic treatment of default and autoepistemic logics

DOI10.1016/S0004-3702(02)00293-XzbMath1010.03021OpenAlexW2037518358MaRDI QIDQ1853682

Victor W. Marek, Marc Denecker, Miroslaw Truszczynski

Publication date: 22 January 2003

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00293-x

zbMATH Keywords

approximationsautoepistemic logicdefault logicfixpoint semanticslattice operators

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Logic in computer science (03B70)

Related Items (24)

On Well-Founded Set-Inductions and Locally Monotone Operators ⋮ Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory ⋮ Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs ⋮ The Truth about Defaults ⋮ Safe inductions and their applications in knowledge representation ⋮ Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach ⋮ On Cascade Products of Answer Set Programs ⋮ Ultimate approximation and its application in nonmonotonic knowledge representation systems ⋮ The place of logic in reasoning ⋮ Grounded fixpoints and their applications in knowledge representation ⋮ Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT ⋮ Fixpoint semantics for active integrity constraints ⋮ Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory ⋮ Non-monotonic reasoning via dynamic consequence ⋮ From Fuzzy to Annotated Semantic Web Languages ⋮ Approximating operators and semantics for abstract dialectical frameworks ⋮ Restricted semantics for default reasoning ⋮ Fixed point semantics for stream reasoning ⋮ EMIL: extracting meaning from inconsistent language. Towards argumentation using a controlled natural language interface ⋮ Flexible Approximators for Approximating Fixpoint Theory ⋮ Approximate well-founded semantics, query answering and generalized normal logic programs over lattices ⋮ Any-world assumptions in logic programming ⋮ Approximation Schemes in Logic and Artificial Intelligence ⋮ Introduction: Progress in formal commonsense reasoning

Cites Work

• Negation by default and unstratifiable logic programs
• Semantical considerations on nonmonotonic logic
• On the relation between default and autoepistemic logic
• A logic for default reasoning
• Non-monotonic logic. I
• Fixpoint semantics for logic programming a survey
• All I know: A study in autoepistemic logic
• Nonmonotonic Logic II
• Complexity Results for Nonmonotonic Logics
• The Semantics of Predicate Logic as a Programming Language
• The well-founded semantics for general logic programs
• Translating default logic into standard autoepistemic logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Uniform semantic treatment of default and autoepistemic logics