Syntactical treatments of propositional attitudes are attractive to artificial intelligence researchers. But results of Montague (1974) and Thomason (1980) seem to show that syntactical treatments are not viable. They show that if representation languages are sufficiently expressive, then axiom schemes characterizing knowledge and belief give rise to paradox. Des Rivières and Levesque (1988) characterize a class of sentences within which these schemes can safely be instantiated. These sentences do not quantify over the propositional objects of knowledge and belief. We argue (...) that their solution is incomplete, and extend it by characterizing a more inclusive class of sentences over which the axiom schemes can safely range. Our sentences do quantify over propositional objects. (shrink)

The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators and . This semantics understands formulas as tasks. An agent , working as a slave for its master , can carry out the task αβ if it can carry out any one of the two tasks α, β, depending on which of them was requested by the master; similarly, it can carry out xα if it can carry out α for any particular (...) value for x selected by the master; an agent can carry out α→β if it can carry out β as long as it has, as a slave , an agent who carries out α; finally, carrying out P, where P is an atomic formula, simply means making P true; in particular, is a task that no agent can carry out. When restricted to the language of classical logic, the meaning of formulas is isomorphic to their classical meaning, which makes our semantics a conservative extension of classical semantics.This semantics can claim to be a formalization of the resource philosophy associated with linear logic, if resources are understood as agents carrying out tasks. The classical operators of our language correspond to the multiplicative operators of linear logic, while and correspond to the additive conjunction and universal quantifier, respectively.Our formalism may also have a potential to be used in AI as an alternative logic of planning and action. Its main appeal is that it is immune to the frame problem and the knowledge preconditions problem.The paper axiomatically defines a logic L in the above language and proves its soundness and completeness with respect to the task semantics in the following intuitive sense: L α iff α can be carried out by an agent who has nothing but its intelligence for carrying out tasks. This logic is shown to be semidecidable in the full language and decidable when the classical quantifier is forbidden in it. (shrink)

Within AI and the cognitively related disciplines, there exist a multiplicity of uses of belief. On the face of it, these differing uses reflect differing views about the nature of an objective phenomenon called belief. In this paper I distinguish six distinct ways in which belief is used in AI. I shall argue that not all these uses reflect a difference of opinion about an objective feature of reality. Rather, in some cases, the differing uses reflect differing concerns with special (...) AI applications. In other cases, however, genuine differences exist about the nature of what we pre-theoretically call belief. To an extent the multiplicity of opinions about, and uses of belief, echoes the discrepant motivations of AI researchers. The relevance of this discussion for cognitive scientists and philosophers arises from the fact that (a) many regard theoretical research within AI as a branch of cognitive science, and (b) even if theoretical AI is not cognitive science, trends within AI influence theories developed within cognitive science. It should be beneficial, therefore, to unravel the distinct uses and motivations surrounding belief, in order to discover which usages merely reflect differing pragmatic concerns, and which usages genuinely reflect divergent views about reality. (shrink)

A process-oriented model of belief is presented which permits the representation of nested propositional attitudes within first-order logic. The model (NIM, for nested intensional model) is axiomatized, sense-based (via intensions), and sanctions inferences involving nested epistemic attitudes, with different agents and different times. Because NIM is grounded upon senses, it provides a framework in which agents may reason about the beliefs of another agent while remaining neutral with respect to the syntactic forms used to express the latter agent's beliefs. Moreover, (...) NIM provides agents with a conceptual map, interrelating the concepts of knowledge, belief, truth, and a number of cognate concepts, such as infers, retracts, and questions. The broad scope of NIM arises in part from the fact that its axioms are represented in a novel extension of first-order logic, -FOL (presented herein). -FOL simultaneously permits the representation of truth ascriptions, implicit self-reference, and arbitrarily embedded sentences within a first-order setting. Through the combined use of principles derived from Frege, Montague, and Kripke, together with context-sensitive semantic conventions, -FOL captures the logic of truth inferences, while avoiding the inconsistencies exhibited by Tarski. Applications of -FOL and NIM to interagent reasoning are described and the soundness and completeness of -FOL are established herein. (shrink)

Reasoning about mental states and processes is important in various subareas of the legal domain. A trial lawyer might need to reason and the beliefs, reasoning and other mental states and processes of members of a jury; a police officer might need to reason about the conjectured beliefs and reasoning of perpetrators; a judge may need to consider a defendant's mental states and processes for the purposes of sentencing and so on. Further, the mental states in question may themselves be (...) about the mental states and processes of other people. Therefore, if AI systems are to assist with reasoning tasks in law, they may need to be able to reason about mental states and processes. Such reasoning is riddled with uncertainty, and this is true in particular in the legal domain. The article discusses how various different types of uncertainty arise, and shows how they greatly complicate the task of reasoning about mental states and processes. The article concentrates on the special case of states of belief and processes of reasoning, and sketches an implemented, prototype computer program (ATT-Meta) that copes with the various types of uncertainty in reasoning about beliefs and reasoning. In particular, the article outlines the system's facilities for handling conflict between different lines of argument, especially when these lie within the reasoning of different people. The system's approach is illustrated by application to a real-life mugging example. [NB: The date on the archived preprint avail via this Phil* page has an incorrect date, 2011, on it. The correct date is 2001.]. (shrink)

[Edited from Conclusion section:] We have looked at various challenging issues to do with getting connectionism to cope with high-level cognitive activities such a reasoning and natural language understanding. The issues are to do with various facets of generalization that are not commonly noted. We have been concerned in particular with the special forms these issues take in the arena of propositional attitude processing. The main problems we have looked at are: (1) The need to construct explicit representations of generalizations, (...) not just generalize correctly to individual cases; (2) The need to be able to match two or more complex short-term information structures, to enable rapid generalization from recent examples rather than from long-term memories; (3) The need to represent and reason with anomalous combinations of concepts; (4) The need to perform embedded reasoning. This presents special problems for systems using non-concatenative representations (as in mainstream connectionist approaches). We also touched on vague quantification in attitude report complements. Neither this topic nor that of analogies between short-term structures (point 2) has been adequately addressed in the symbolic framework, let alone in connectionism. -/- The opportunities and problems covered are put forward as things worth being optimistic about or pessimistic about, respectively. They are not put forward as decisive arguments for or against connectionism. The hope is that this chapter contributes to a greater understanding of the connectionist/symbolist gap by presenting some unusual issues and by throwing new light on some well known ones. (shrink)

The notion of Simulative Reasoning in the study of propositional attitudes within Artificial Intelligence (AI) is strongly related to the Simulation Theory of mental ascription in Philosophy. Roughly speaking, when an AI system engages in Simulative Reasoning about a target agent, it reasons with that agent’s beliefs as temporary hypotheses of its own, thereby coming to conclusions about what the agent might conclude or might have concluded. The contrast is with non-simulative meta-reasoning, where the AI system reasons within a detailed (...) theory about the agent’s (conjectured) reasoning acts. The motive within AI for preferring Simulative Reasoning is that it is more convenient and efficient, because of a simplification of the representations and reasoning processes. The chapter discusses this advantage in detail. It also sketches the use of Simulative Reasoning in an AI natural language processing system, ATT-Meta, that is currently being implemented. This system is directed at the understanding of propositional attitude reports. In ATT-Meta, Simulative Reasoning is yoked to a somewhat independent set of ideas about how attitude reports should be treated. Central here are the claims that (a) speakers often employ commonsense (and largely metaphorical) models of mind in describing agents’ attitudes, (b) the listener accordingly needs often to reason within the terms of such models, rather than on the basis of any objectively justifiable characterization of the mind, and (c) the commonsense models filter the suggestions that Simulative Reasoning comes up with concerning target agents’ reasoning conclusions. There is a yet tighter connection between the commonsense models and the Simulative Reasoning. It turns out that Simulative Reasoning can be rationally reconstructed in terms of a more general type of reasoning about the possibly-counterfactual “world” that the target agent believes in, together with an assumption that that agent has a faithful representation of the world. In the ATT-Meta approach, the reasoner adopts that assumption when it views the target agent through a particular commonsense model (called IDEAS-AS-MODELS). (shrink)