This essay presents a philosophical and computational theory of the representation of de re, de dicto, nested, and quasi-indexical belief reports expressed in natural language. The propositional Semantic Network Processing System (SNePS) is used for representing and reasoning about these reports. In particular, quasi-indicators (indexical expressions occurring in intentional contexts and representing uses of indicators by another speaker) pose problems for natural-language representation and reasoning systems, because--unlike pure indicators--they cannot be replaced by coreferential NPs without changing the meaning of the (...) embedding sentence. Therefore, the referent of the quasi-indicator must be represented in such a way that no invalid coreferential claims are entailed. The importance of quasi-indicators is discussed, and it is shown that all four of the above categories of belief reports can be handled by a single representational technique using belief spaces containing intensional entities. Inference rules and belief-revision techniques for the system are also examined. (shrink)

This article discusses the extension of ViewGen, an algorithm derived for belief ascription, to the areas of intensional object identification and metaphor. ViewGen represents the beliefs of agents as explicit, partitioned proposition sets known as environments. Environments are convenient, even essential, for addressing important pragmatic issues of reasoning. The article concentrates on showing that the transformation of information in metaphors, intensional object identification, and ordinary, nonmetaphorical belief ascription can all be seen as different manifestations of a single environment-amalgamation process. The (...) article also briefly discusses the extension of ViewGen to speech-act processing and the addition of a heuristic-based relevance-determination procedure, and justifies the partitioning approach to belief ascription. (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)