scientific article; zbMATH DE number 1269578
In this chapter, we will concentrate on the defeasible approach to nonmonotonic reasoning, as opposed to the minimalist approach and the fixpoint approach. Formalisms following the minimalist approach, like circumscription, look at models of a classical theory that are minimal with respect to some set of predicates occurring in the theory. Fixpoint formalisms include McDermott and Doyle's nonmonotonic logic, Reiter's default logic, and Moore's autoepistemic logic. Default rules in these systems involve a special condition for application, which is explained in the proof theory. By applying rules in an arbitrary order, some other rules may become blocked, and eventually, a fixpoint is derived from where no new conclusions can be reached. At a fixpoint, every default is either inapplicable or applied. The same holds for minimal models. In the defeasible approach, defaults are treated quite differently. The intent of a default \(A\to p\) is that \(p\) will normally be derivable from a theory containing this default whenever \(A\) is derivable. However, it is possible to have a theory containing \(A\to p\) from which both \(A\) and \(\neg p\) can be derived. If this is the case, the rule \(A\to p\) is said to be defeated. Rules which can be defeated are called defeasible rules and logics using defeasible rules are called defeasible logics. In a defeasible logic formalism, extensions of theories are formed, in which each rule is either inapplicable, applied or defeated. In case of a conflict, defeasible logics usually rely on some kind of ordering on defeasible rules or sets of rules in an attempt to resolve this conflict. This prioritization can be implicitly present in the knowledge base, in which case it is based on some notion of specificity, or explicitly given by the user. Both approaches have their pros and cons, which will be discussed at the end of this chapter. For the entire collection see [Zbl 0908.90002].
- Revision of defeasible preferences
- Defeasible logic with dynamic priorities
- scientific article; zbMATH DE number 5161842 (Why is no real title available?)
- Semantics for Pollock's defeasible reasoning
- Annotated defeasible logic
- scientific article; zbMATH DE number 1852916 (Why is no real title available?)
- Defeasible conditionalization
- Relative expressiveness of defeasible logics
- Defeasible logic versus Logic Programming without Negation as Failure
- A New Perspective on Nonmonotonic Logics
- Towards a natural way of reasoning
- A logic-based theory of deductive arguments
- Defeasible reasoning with variable degrees of justification
- Adversarial logic
- A mathematical treatment of defeasible reasoning and its implementation.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4236378)
