This chapter begins with a discussion of Indian theories of inference. It identifies the unique features of Indian logic not found in Western logic. Indian theories of inference are primarily theories of adequate evidence, but they may also be viewed as systems of nonmonotonic reasoning, which is being used in modern computer simulation of actual human reasoning processes. The chapter then discusses Nyāya logic, Buddhist logic, Jaina logic, and Navya–Nyāya logic.

Since it was presented in 1963, Chisholm’s paradox has attracted constant attention in the deontic logic literature, but without the emergence of any definitive solution. We claim this is due to its having no single solution. The paradox actually presents many challenges to the formalization of deontic statements, including (1) context sensitivity of unconditional oughts, (2) formalizing conditional oughts, and (3) distinguishing generic from nongeneric oughts. Using the practical interpretation of ‘ought’ as a guideline, we propose a linguistically motivated logical (...) solution to each of these problems, and explain the relation of the solution to the problem of contrary-to-duty obligations. (shrink)

inheritance reasoning in semantic networks allowing for multiple inheritance with exceptions. The approach leads to a definition of iaheritance that is..

We identify a class of paradoxes that is neither set-theoretical nor semantical, but that seems to depend on intensionality. In particular, these paradoxes arise out of plausible properties of propositional attitudes and their objects. We try to explain why logicians have neglected these paradoxes, and to show that, like the Russell Paradox and the direct discourse Liar Paradox, these intensional paradoxes are recalcitrant and challenge logical analysis. Indeed, when we take these paradoxes seriously, we may need to rethink the commonly (...) accepted methods for dealing with the logical paradoxes. (shrink)

A propositional system of modal logic is second-order if it contains quantifiers ∀p and ∃p, which, in the standard interpretation, are construed as ranging over sets of possible worlds (propositions). Most second-order systems of modal logic are highly intractable; for instance, when augmented with propositional quantifiers, K, B, T, K4 and S4 all become effectively equivalent to full second-order logic. An exception is S5, which, being interpretable in monadic second-order logic, is decidable.

My chief aim has been to convey the thought that the application of model theoretic techniques to natural languages needn't force a distortion of intentional phenomena. I hope that at least I have succeeded in accomplishing this.

Following the pioneer work of Bruno De Finetti [12], conditional probability spaces (allowing for conditioning with events of measure zero) have been studied since (at least) the 1950's. Perhaps the most salient axiomatizations are Karl Popper's in [31], and Alfred Renyi's in [33]. Nonstandard probability spaces [34] are a well know alternative to this approach. Vann McGee proposed in [30] a result relating both approaches by showing that the standard values of infinitesimal probability functions are representable as Popper functions, and (...) that every Popper function is representable in terms of the standard real values of some infinitesimal measure. Our main goal in this article is to study the constraints on (qualitative and probabilistic) change imposed by an extended version of McGee's result. We focus on an extension capable of allowing for iterated changes of view. Such extension, we argue, seems to be needed in almost all considered applications. Since most of the available axiomatizations stipulate (definitionally) important constraints on iterated change, we propose a non-questionbegging framework, Iterative Probability Systems (IPS) and we show that every Popper function can be regarded as a Bayesian IPS. A generalized version of McGee's result is then proved and several of its consequences considered. In particular we note that our proof requires the imposition of Cumulativity, i.e. the principle that a proposition that is accepted at any stage of an iterative process of acceptance will continue to be accepted at any later stage. The plausibility and range of applicability of Cumulativity is then studied. In particular we appeal to a method for defining belief from conditional probability (first proposed in [42] and then slightly modified in [6] and [3]) in order to characterize the notion of qualitative change induced by Cumulative models of probability kinematics. The resulting cumulative notion is then compared with existing axiomatizations of belief change and probabilistic supposition. We also consider applications in the probabilistic accounts of conditionals [1] and [30]. (shrink)

The first amounts, roughly, to "It is necessarily the case that any President of the U.S. is a citizen of the U.S." But the second says, "the person who in fact is the President of the U.S, has the property of necessarily being a citizen of the U.S," Thus, while (2) is clearly true, it would be reasonable to consider (3) false.

Early attempts at combining multiple inheritance with nonmonotonic reasoning were based on straightforward extensions of tree-structured inheritance systems, and were theoretically unsound. In The Mathcmat~'cs of Inheritance Systcrns, or TMOIS, Touretzky described two problems these systems cannot handle: reasoning in the presence of true but redundant assertions, and coping with ambiguity. TMOIS provided a definition and analysis of a theoretically sound multiple inheritance system, accom-.

For as long as there have been theories about common knowledge, they have been exposed to a certain amount of skepticism. Recent more sophisticated arguments question whether agents can acquire common attitudes and whether they are needed in social reasoning. I argue that this skepticism arises from assumptions about practical reasoning that, considered in themselves, are at worst implausible and at best controversial. A proper approach to the acquisition of attitudes and their deployment in decision making leaves room for common (...) attitudes. Postulating them is no worse off than similar idealizations that are usefully made in logic and economics. (shrink)

This chapter presents an overview of the issues that arise when logic is used in helping to understand problems in intelligent reasoning and to guide the design of mechanized reasoning systems. It provides some historical and technical details concerning nonmonotonic logic and reasoning about action and change, a topic that is not only central in artificial intelligence but that is normally of considerable interest to philosophers. The remaining sections provide brief sketches of selected topics, with references to the primary literature.

The interpretation of indirect discourse is one of the most persistent and pervasive themes in post-Fregean semantics. Since Frege we have managed to learn a good deal about the workings of various technical approaches to indirect discourse, but fundamental philosophical issues have remained unresolved.

This paper develops a general approach to contextual reasoning in natural language processing. Drawing on the view of natural language interpretation as abduction (Hobbs et al., 1993), we propose that interpretation provides an explanation of how an utterance creates a new discourse context in which its interpreted content is both true and promi- nent. Our framework uses dynamic theories of semantics and pragmatics, formal theories of context, and models of attentional state. We describe and illustrate a Prolog implementation.

This paper proposes a formalization of ability that is motivated in part by linguistic considerations and by the philosophical literature in action theory and the logic of ability, but that is also meant to match well with planning formalisms, and so to provide an account of the role of ability in practical reasoning. Some of the philosophical literature concerning ability, and in particular [Austin, 1956], suggests that some ways of talking about ability are context-dependent. I propose a way of formalizing (...) this dependency. (shrink)

The psychological orientation treats semantics as a matter of idealized computation over symbolic structures, and semantic relations like denotation as relations between linguistic expressions and these structures. I argue that results similar to Gödel's incompleteness theorems and Tarski's theorem on truth create foundational difficulties for this view of semantics.

Context has emerged as a central concept in a variety of contemporary approaches to reasoning. The conference at which the papers in this volume were presented, CONTEXT 2001, was the third international, interdisciplinary conference on the topic of context, and was held in Dundee, Scotland on July 27-30, 2001.

We relate the theory of presupposition accommodation to a computational framework for reasoning in conversation. We understand presuppositions as private commitments the speaker makes in using an utterance but expects the listener to recognize based on mutual information. On this understanding, the conversation can move forward not just through the positive effects of interlocutors’ utterances but also from the retrospective insight interlocutors gain about one anothers’ mental states from observing what they do. Our title, ENLIGHTENED UPDATE, highlights such cases. Our (...) approach fleshes out two key principles: that interpretation is a form of intention recognition; and that intentions are complex informational structures, which specify commitments to conditions and to outcomes as well as to actions. We present a formalization and implementation of these principles for a simple conversational agent, and draw on this case study to argue that pragmatic reasoning is holistic in character, continuous with common-sense reasoning about collaborative activities, and most effectively characterized by associating specific, reliable interpretive constraints directly with grammatical forms. In showing how to make such claims precise and to develop theories that respect them, we illustrate the general place of computation in the cognitive science of language. (shrink)

Deontic logic, as traditionally conceived, provides only a deductive theory that constrains the states or possible worlds within which an agent should try to remain.