A theory of analogical mapping between source and target analogs based upon Interacting structural, semantic, and pragmatic constraints is proposed here. The structural constraint of isomorphism encourages mappings that maximize the consistency of relational corresondences between the elements of the two analogs. The constraint of semantic similarity supports mapping hypotheses to the degree that mapped predicates have similar meanings. The constraint of prog-mafic central/! / favors mappings involving elements the analogist believes to be Important in order to achieve the purpose for which the analogy Is being used. The theory is implemented in a computer program called ACME (Analogical Constraint Mapping Engine), which represents constraints by means of a network of supporting and competing hypotheses regarding what elements to map. A coop-erative algorithm for parallel constraint satisfaction identifies mapping hypotheses that collectively represent the overall mapping that best fits the interacting constraints. ACME has been applied to a wide range of examples that include problem analogies, analogical arguments, explanatory analogies, story analogies, formal analogies, and metaphors. ACME is sensitive to semantic and pragmatic Information if it Is available,.and yet able to compute mappings between formally Isomorphic analogs without any similar or identical elements. The theory Is able to account for empirical findings regarding the impact of consistency and similarity on human processing of analogies.

We describe an algorithm which allows a behavior-based robot to learn on the basis of positive and negative feedback when to activate its behaviors. In accordance with the philosophy of behavior-based robots, the algorithm is completely distributed: each of the behaviors independently tries to find out (i) whether it is relevant (ie. whether it is at all correlated to positive feedback) and (ii) what the conditions are under which it becomes reliable (i.e. the conditions under which it maximizes the probability of receiving positive feedback and minimizes the probability of receiving negative feedback). The algorithm has been tested successfully on an autonomous 6-legged robot which had to learn how to coordinate its legs so as to walk forward. Situation of the Problem Since 1985, the MIT Mobile Robot group has advocated a radically different architecture for autonomous intelligent agents (Brooks, 1986). Instead of decomposing the architecture into functional modules, such as percept...

A stochastic optimized-submovement model is proposed for Pitts ' law, the classic logarithmic tradeoff between the duration and spatial precision of rapid aimed movements. According to the model, an aimed movement toward a specified target region involves a primary submovement and an optional secondary corrective submovement. The submovements are assumed to be programmed such that they minimize average total movement time while maintaining a high frequency of target hits. The programming process achieves this minimization by optimally adjusting the average magnitudes and durations of noisy neuromotor force pulses used to generate the submovements. Numerous results from the literature on human motor performance may be explained in these terms. Two new experiments on rapid wrist rotations yield additional support for the stochastic optimizedsubmovement model. Experiment 1 revealed that the mean durations of primary submovements and of secondary submovements, not just average total movement times, conform to a square-root approximation of Pitts ' law derived from the model. Also, the spatial endpoints of primary submovements have standard deviations that increase linearly with average primary-submovement velocity, and the average primary-submovement velocity influences the relative frequencies of secondary submovements, as predicted by the model. During Experiment 2, these results were replicated and

It is argued that working memory limitations are best defined in terms of the complexity of relations that can be processed in parallel. Relational complexity is related to processing loads in problem solving, and discriminates between higher animal species, as well as between children of different ages. Complexity is defined by the number of dimensions, or sources of variation, that are related. A unary relation has one argument and one source of variation, because its argument can be instantiated in only one way at a time. A binary relation has two arguments, and two sources of variation, because two argument instantiations are possible at once. Similarly, a ternary relation is three dimensional, a quaternary relation is four dimensional, and so on. Dimensionality is related to number of chunks, because both attributes on dimensions and chunks are independent units of information of arbitrary size. Empirical studies of working memory limitations indicate a soft limit which corresponds to processing one quaternary relation in parallel. More complex concepts are processed by segmentation or conceptual chunking. Segmentation entails breaking tasks into components which do not exceed processing capacity, and which are processed serially. Conceptual chunking entails "collapsing" representations to reduce their dimensionality and consequently their processing load, but at the cost of making some relational information inaccessible. Parallel distributed processing implementations of relational representations show that relations with more arguments entail a higher computational cost, which corresponds to empirical observations of higher processing loads in humans. Empirical evidence is presented that relational complexity discriminates between higher species...

Advanced perceptual systems are faced with the problem of securing a principled relationship between the world and its internal representation. I propose a unified approach to visual representation, based on Shepard's (1968) notion of second-order isomorphism. According to the proposed theory, a shape is represented internally by the responses of a few tuned modules, each of which is broadly selective for some reference shape, whose similarity to the stimulus it measures. The result is a philosophically appealing, computationally feasible, biologically credible, and formally veridical representation of a distal shape space. This approach supports representation of and discrimination among shapes radically different from the reference ones, while bypassing the need for the computationally problematic decomposition into parts; it also addresses the needs of shape categorization, and can be used to derive a range of models of perceived similarity. Representation is Representation of Sim...

It is now possible to build machine learning systems whose behavior is consistent with data from human students. How can education use such simulated students? Applications that help three user groups are discussed. Teachers can practice the art of tutoring byhaving them teach a simulated student. Using a simulation instead of a real student allows teachers to see how their actions affect that student's knowledge, to undo their actions, and to try their skills on students with varying prior knowledge and learning strategies. Students can learn in collaboration with a simulated student. Because the simulated student can be simultaneously an expert and a colearner, it can scaffold and guide the human's learning in subtle ways. Instructional developers can test their instruction on simulated students. Unlike formativeevaluations with real students, a simulation-based evaluation can indicate exactly what piece of the instruction caused which pieces of knowledge, and thus help developers troubleshoot their instructional designs early in the design process. For each of these three areas of application, inherent technical limitations, existing systems and prospective systems are discussed.

this document. 9.5.2 A comparison of CUE and libido

We summarize selected recent developments and promising directions for improving the quality of models of human performance in synthetic environments. The potential uses and goals for behavioral models in synthetic environments are first summarized. Within that context, we examine relevant, current work related to modeling more complete performance, for example, on cognitive modeling of emotion, advanced techniques for testing and building models of behavior, new cognitive architectures, and agent and Belief, Desires and Intentions (BDI) technology. The report also considers the usability of these systems as an important but neglected aspect of their performance. A list of projects with high payoff for modeling human performance in synthetic environments is noted.

Inducing causal relationships from observations is a classic problem in scientific inference, statistics, and machine learning. It is also a central part of human learning, and a task that people perform remarkably well given its notorious difficulties. People can learn causal structure in various settings, from diverse forms of data: observations of the co-occurrence frequencies between causes and effects, interactions between physical objects, or patterns of spatial or temporal coincidence. These different modes of learning are typically thought of as distinct psychological processes and are rarely studied together, but at heart they present the same inductive challenge—identifying the unobservable mechanisms that generate observable relations between variables, objects, or events, given only sparse and limited data. We present a computational-level analysis of this inductive problem and a framework for its solution, which allows us to model all these forms of causal learning in a common language. In this framework, causal induction is the product of domain-general statistical inference guided by domain-specific prior knowledge, in the form of an abstract causal theory. We identify 3 key aspects of abstract prior knowledge—the ontology of entities, properties, and relations that organizes a domain; the plausibility of specific causal relationships; and the functional form of those relationships—and show how they provide the constraints that people need to induce useful causal models from sparse data.

A representational scheme under which the ranking between represented similarities is isomorphic to the ranking between the corresponding shape similarities can support perfectly correct shape classification, because it preserves the clustering of shapes according to the natural kinds prevailing in the external world. This note discusses the computational requirements of representation that preserves similarity ranks, and points out the relative straightforwardness of its connectionist implementation. 1 Introduction 1.1 Two problems of representation It is possible to distinguish between two problems about mental representation (Cummins, 1989). The first of these, the problem of representations (plural), is basically empirical; two instances of this problem are the search for the representations employed by natural cognitive systems, and the design of the representational substrate for artificial cognitive modules. The second problem is called by Cummins the Problem of Representation...