Alternative foundations for Reiter's default logic
We introduce an alternative conceptual basis for default reasoning in Reiter's default logic. In fact, most formal or computational treatments of default logic suffer from the necessity of exhaustive consistency checks with respect to the finally resulting set of conclusions; often this so-called extension is just about being constructed. On the theoretical side, this exhaustive approach is reflected by the usual fixed-point characterizations of extensions. Our goal is to reduce such global considerations to local and strictly necessary ones. For this purpose, we develop various techniques and instruments that draw on an analysis of interaction patterns between default rules, embodied by their mutual blocking behavior. These formal tools provide us with alternative means for addressing a variety of questions in default logic. We demonstrate the utility of our approach by applying it to three traditional problems. First, we obtain a range of criteria guaranteeing the existence and non-existence of extensions. Second, we get alternative characterizations of extensions that avoid fixed-point conditions. Finally, we furnish a formal account of default proofs that was up to now neglected in the literature.
- 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
- 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?)
- 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
- Alternative approaches to default logic
- Alternative foundations for Reiter's default logic
- Consistency defaults
- Seminormalizing a default theory
- scientific article; zbMATH DE number 2064305 (Why is no real title available?)
- scientific article; zbMATH DE number 1394297 (Why is no real title available?)
- Hypersequent calculi for propositional default logics
- A new default theories compilation for MSP-entailment
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)
