Alternative foundations for Reiter's default logic

DOI10.1016/S0004-3702(00)00060-6zbMATH Open0952.68135MaRDI QIDQ1589575FDOQ1589575

Authors T. Linke, Torsten Schaub

Publication date 12 December 2000

Published in Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

consistencyargumentationnonmonotonic reasoningblock graphknowledge representationautomated reasoningdefault logic

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 1453066
• Alternative approaches to default logic
• scientific article; zbMATH DE number 6958
• scientific article; zbMATH DE number 140378
• A directly cautious theory of defeasible consequence for default logic via the notion of general extension

Cites work

• scientific article; zbMATH DE number 44622 (Why is no real title available?)
• scientific article; zbMATH DE number 1301757 (Why is no real title available?)
• scientific article; zbMATH DE number 478394 (Why is no real title available?)
• scientific article; zbMATH DE number 194964 (Why is no real title available?)
• scientific article; zbMATH DE number 6958 (Why is no real title available?)
• scientific article; zbMATH DE number 1453066 (Why is no real title available?)
• A Computing Procedure for Quantification Theory
• A graph-theoretic approach to default logic
• A logic for default reasoning
• A new methodology for query answering in default logics via structure-oriented theorem proving
• A query answering algorithm for Lukaszewicz' general open default theory
• A sequent calculus for skeptical Default Logic
• A tableaux-based theorem prover for a decidable subset of default logic
• Alternative approaches to default logic
• Alternative foundations for Reiter's default logic
• An abstract, argumentation-theoretic approach to default reasoning
• Analytic tableaux for default logics
• Circumscription - a form of non-monotonic reasoning
• Compiling specificity into approaches to nonmonotonic reasoning
• Complexity Results for Nonmonotonic Logics
• Computing argumentation in logic programming
• Cumulative default logic: In defense of nonmonotonic inference rules
• Default theories that always have extensions
• Formalizing nonmonotonic reasoning systems
• Graph theoretical structures in logic programs and default theories
• Is intractability of nonmonotonic reasoning a real drawback?
• Reasoning with stratified default theories
• Sequent calculi for default and autoepistemic logics
• Solutions of irreflexive relations
• Tableau-based characterization and theorem proving for default logic
• The Pure Logic of Necessitation

Cited in

(7)

• Seminormalizing a default theory
• scientific article; zbMATH DE number 1394297 (Why is no real title available?)
• scientific article; zbMATH DE number 2064305 (Why is no real title available?)
• Alternative foundations for Reiter's default logic
• Alternative approaches to default logic
• Consistency defaults
• A new default theories compilation for MSP-entailment

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: Alternative foundations for Reiter's default logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589575)