Off-campus access
Using PhilPapers from home?
Click here to configure this browser for off-campus access.
- Keith Frankish, Non-Monotonic Inference.Non-monotonic inference is inference that is defeasible: in contrast with deductive inference, the conclusions drawn may be withdrawn in the light of further information, even though all the original premises are retained. Much of our everyday reasoning is like this, and a non-monotonic approach has applications to a number of technical problems in artificial intelligence. Work on formalizing non-monotonic inference has progressed rapidly since its beginnings in the 1970s, and a number of mature theories now exist – the most important being default logic, autoepistemic logic, and circumscription.No categories
Similar books and articles
One of the most important developments over the last twenty years both in logic and in Artificial Intelligence is the emergence of so-called non-monotonic logics. These logics were initially developed by McCarthy [10], McDermott & Doyle [13], and Reiter [17]. Part of the original motivation was to provide a formal framework within which to model cognitive phenomena such as defeasible inference and defeasible knowledge representation, i.e., to provide a formal account of the fact that reasoners can reach conclusions tentatively, reserving the right to retract them in the light of further information.
No categories
The emergence, over the last twenty years or so, of so-called “non-monotonic” logics represents one of the most significant developments both in logic and artificial intelligence. These logics were devised in order to represent defeasible reasoning, i.e., that kind of inference in which reasoners draw conclusions tentatively, reserving the right to retract them in the light of further evidence.
A conservative extension of first order logic, suitable for circumscriptive inference, is introduced.
Classic deductive logic entails that once a conclusion is sustained by a valid argument, the argument can never be invalidated, no matter how many new premises are added. This derived property of deductive reasoning is known as monotonicity. Monotonicity is thought to conflict with the defeasibility of reasoning in natural language, where the discovery of new information often leads us to reject conclusions that we once accepted. This perceived failure of monotonic reasoning to observe the defeasibility of natural-language arguments has led some philosophers to abandon deduction itself (!), often in favor of new, non-monotonic systems of inference known as `default logics'. But these radical logics (e.g., Ray Reiter's default logic) introduce their desired defeasibility at the expense of other, equally important intuitions about natural-language reasoning. And, as a matter of fact, if we recognize that monotonicity is a property of the form of a deductive argument and not its content (i.e., the claims in the premise(s) and conclusion), we can see how the common-sense notion of defeasibility can actually be captured by a purely deductive system.
No categories
Among non-monotonic systems of reasoning, non-monotonic modal logics, and autoepistemic logic in particular, have had considerable success. The presence of explicit modal operators allows flexibility in the embedding of other approaches. Also several theoretical results of interest have been established concerning these logics. In this paper we introduce non-monotonic modal logics based on many-valued logics, rather than on classical logic. This extends earlier work of ours on many-valued modal logics. Intended applications are to situations involving several reasoners, not just one as in the standard development.
This paper spells out a dynamic proof format for the pure logic of relevant implication. (A proof is dynamic if a formula derived at some stage need not be derived at a later stage.) The paper illustrates three interesting points. (i) A set of properties that characterizes an inference relation on the (very natural) dynamic proof interpretation, need not characterize the same inference relation (or even any inference relation) on the usual set-theoretical interpretation. (ii) A proof format may display an internal dynamics (defeasible conclusions) in the absence of an external dynamics (non-monotonicity). (iii) A monotonic logic may have a non-monotonic characterization.
This paper analyses the logical structure of the balancing of conflicting normative arguments, and asks whether non-monotonic logic is adequate to represent this type of legal or practical reasoning. Norm conflicts are often regarded as a field of application for non-monotonic logics. This paper argues, however, that the balancing of normative arguments consists of an act of judgement, not a logical inference, and that models of deductive as well as of defeasible reasoning do not give an adequate account of its structure. Moreover, it argues that as far as the argumentation consists in logical inferences, deductive logic suffices for reconstructing the argumentation from the internal point of view of someone making normative judgements.
Logic is a celebrated representation language because of its formal generality. But there are two senses in which a logic may be considered general, one that concerns a technical ability to discriminate between different types of individuals, and another that concerns constitutive norms for reasoning as such. This essay embraces the former, permutation-invariance conception of logic and rejects the latter, Fregean conception of logic. The question of how to apply logic under this pure invariantist view is addressed, and a methodology is given. The pure invariantist view is contrasted with logical pluralism, and a methodology for applied logic is demonstrated in remarks on a variety of issues concerning non-monotonic logic and non-monotonic inference, including Charles Morgan’s impossibility results for non-monotonic logic, David Makinson’s normative constraints for non-monotonic inference, and Igor Douven and Timothy Williamson’s proposed formal constraints on rational acceptance.
Any inferential system in which the addition of new premises can lead to the retraction of previous conclusions is a non-monotonic logic. Classical conditional probability provides the oldest and most widely respected example of non-monotonic inference. This paper presents a semantic theory for a unified approach to qualitative and quantitative non-monotonic logic. The qualitative logic is unlike most other non- monotonic logics developed for AI systems. It is closely related to classical (i.e., Bayesian) probability theory. The semantic theory for qualitative non-monotonic entailments extends in a straightforward way to a semantic theory for quantitative partial entailment relations, and these relations turn out to be the classical probability functions.
The term "non-monotonic logic" covers a family of formal frameworks devised to capture and represent defeasible inference , i.e., that kind of inference of everyday life in which reasoners draw conclusions tentatively, reserving the right to retract them in the light of further information. Such inferences are called "non-monotonic" because the set of conclusions warranted on the basis of a given knowledge base does not increase (in fact, it can shrink) with the size of the knowledge base itself. This is in contrast to classical (first-order) logic, whose inferences, being deductively valid, can never be "undone" by new information.
Discussion of Keith Frankish, Non-monotonic inference
|
|
There are no threads in this forum |
Nothing in this forum yet.

