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)

This paper is a commentary on the target article by Lokendra Shastri & Venkat Ajjanagadde [S&A]: “From simple associations to systematic reasoning: A connectionist representation of rules, variables and dynamic bindings using temporal synchrony” in same issue of the journal, pp.417–451. -/- It puts S&A's temporal-synchrony binding method in a broader context, comments on notions of pointing and other ways of associating information - in both computers and connectionist systems - and mentions types of reasoning that are a challenge to (...) S&A's system (amongst many other connectionist systems, recognizing that S&A's is much more capable as regards reasoning than most other contemporary systems). (shrink)

Connectionist attention to variables has been too restricted in two ways. First, it has not exploited certain ways of doing without variables in the symbolic arena. One variable-avoidance method, that of logical combinators, is particularly well established there. Secondly, the attention has been largely restricted to variables in long-term rules embodied in connection weight patterns. However, short-lived bodies of information, such as sentence interpretations or inference products, may involve quantification. Therefore short-lived activation patterns may need to achieve the effect of (...) variables. The paper is mainly a theoretical analysis of some benefits and drawbacks of using logical combinators to avoid variables in short-lived connectionist encodings without loss of expressive power. The paper also includes a brief survey of some possible methods for avoiding variables other than by using combinators. (shrink)

Human agents draw a variety of inferences effortlessly, spontaneously, and with remarkable efficiency – as though these inferences were a reflexive response of their cognitive apparatus. Furthermore, these inferences are drawn with reference to a large body of background knowledge. This remarkable human ability seems paradoxical given the complexity of reasoning reported by researchers in artificial intelligence. It also poses a challenge for cognitive science and computational neuroscience: How can a system of simple and slow neuronlike elements represent a large (...) body of systemic knowledge and perform a range of inferences with such speed? We describe a computational model that takes a step toward addressing the cognitive science challenge and resolving the artificial intelligence paradox. We show how a connectionist network can encode millions of facts and rules involving n-ary predicates and variables and perform a class of inferences in a few hundred milliseconds. Efficient reasoning requires the rapid representation and propagation of dynamic bindings. Our model (which we refer to as SHRUTI) achieves this by representing (1) dynamic bindings as the synchronous firing of appropriate nodes, (2) rules as interconnection patterns that direct the propagation of rhythmic activity, and (3) long-term facts as temporal pattern-matching subnetworks. The model is consistent with recent neurophysiological evidence that synchronous activity occurs in the brain and may play a representational role in neural information processing. The model also makes specific psychologically significant predictions about the nature of reflexive reasoning. It identifies constraints on the form of rules that may participate in such reasoning and relates the capacity of the working memory underlying reflexive reasoning to biological parameters such as the lowest frequency at which nodes can sustain synchronous oscillations and the coarseness of synchronization. (shrink)