"We describe the concept of distributed problem solving and define it as the cooperative solution of problems by a decentralized and loosely coupled collection of problem solvers. This approach to problem solving offers the promise of increased performance and provides a useful medium for exploring and developing new problem-solving techniques. We present a framework called the contract net that specifies communication and control in a distributed problem solver. Task distribution is viewed as an interactive process, a discussion carried on between a node with a task to be executed and a group of nodes that may be able to execute the task. We describe the kinds of information that must be passed between nodes during the discussion in order to obtain effective problem-solving behavior. This discussion is the origin of the negotiation metaphor: Task distribution is viewed as a form of contract negotiation. We emphasize that protocols for distributed problem solving should help determine the content of the information transmitted, rather than simply provide a means of sending bits from one node to another. The use of the contract net framework is demonstrated in the solution of a simulated problem in area surveillance, of the sort encountered in ship or air traffic control. We discuss the mode of operation of a distributed sensing system, a network of nodes extending throughout a relatively large geographic area, whose primary aim is the formation of a dynamic map of traffic in the area. From the results of this preliminary study we abstract features of the framework applicable to problem solving in general, examining in particular transfer of control. Comparisons with PLANNER, CONNIVER, HEARSAY-II, AND PUP6 are used to demonstrate that negotiation—the two-way transfer of information—is a natural extension to the transfer of control mechanisms used in earlier problem-solving systems." Artificial Intelligence 20:63-109.

This study presents a process model of very long-term episodic memory. The process presented is a reconstructive process. The first is used to direct search to appropriate conceptual categories in memory. The other two are used to direct search within the chosen conceptual category. A fourth type of strategy, called executive search strategies, guide search for concepts related to the one targeted for retrieval.

A new parameter is introduced to characterize a type of search problem of broad relevance in artificial intelligence, operations research and symbolic logic. This parameter, which we call inter-variable compatibility, is particularly important in that complexity analyses incorporating it are able to capture the dependence of problem complexity on search order used by an algorithm. Thus compatibility-based theories can provide a theoretical basis for the extraction of heuristics for choosing good search orderings—a long-sought goal for such problems, since it can lead to significant savings during search. We carry out expected-complexity analyses for the traditional backtrack algorithm as well as for two more recent algorithms that have been found empirically to be significant improvements: forward checking and word-wise forward checking. We extract compatibility-based ordering-heuristics from the theory for forward checking.

A theory of analogy must describe how the meaning of an analogy is derived from the meanings of its parts. In the structure-mapping theory, the interpretation rules are characterized as implicit rules for mapping knowledge about a base domain into a target domain. Two important features of the theory are (a) the rules depend only on syntactic properties of the knowledge representation, and not on the specific content of the domains; and (b) the theoretical framework allows analogies to be distinguished cleanly from literal similarity statements, applications of abstractions, and other kinds of comparisons. Two mapping principles are described: (a) Relations between objects, rather than attributes of objects, are mapped from base to target; and (b) The particular relations mapped are determined by systematicity, as defined by the existence of higher-order relations.

Almost all game tree search procedures used in artificial intelligence are variants on minimaxing. Until recently, it was almost universally believed that searching deeper on the game tree with such procedures would in general yield a better decision. However, recent investigations have revealed the existence of many game trees and evaluation functions which are ‘pathological’ in the sense that searching deeper consistently degrades the decision. This paper extends these investigations in two ways. First, it is shown that whenever the evaluation function satisfies certain properties, pathology will occur on any game tree of high enough constant branching factor.

An extention of the alpha-beta tree pruning strategy to game trees with ‘probability’ nodes, whose values are defined as the (possibly weighted) average of their successors' values, is developed. These ‘*-minimax’ trees pertain to games involving chance but no concealed information. Based upon our search strategy, we formulate and then analyze several algorithms for *-minimax trees. An initial left-to-right depth-first algorithm is developed and shown to reduce the complexity of an exhaustive search strategy by 25–30 percent. An improved algorithm is then formulated to ‘probe’ beneath the chance nodes of ‘regular’ *-minimax trees, where players alternate in making moves with chance events interspersed.

In response to a world in which cancer is a growing global health challenge, there is now a greater need for US Medical Physicists and other Radiation Oncology professionals across institutions to work together and be more globally engaged in the fight against cancer. There are currently many opportunities for Medical Physicists to contribute to alleviating this pressing need, especially in helping enhance access to Medical Physics Education/training and Research Excellence across international boundaries, particularly for low and middle-income countries (LMIC), which suffer from a drastic shortage of accessible knowledge and quality training programs in radiotherapy. Many Medical Physicists aremore » not aware of the range of opportunities that even with small effort could have a high impact. Faculty at the two CAMPEP-accredited Medical Physics Programs in New England: the University of Massachusetts Lowell and Harvard Medical School have developed a growing alliance to increase Access to Medical Physics Education/training and Research Excellence (AMPERE), and facilitate greater active involvement of U.S. Medical Physicists in helping the global fight against cancer and cancer disparities. In this symposium, AMPERE Alliance members and partners from Europe and Africa will present and discuss the growing global cancer challenge, the dearth of knowledge, research, and other barriers to providing life-saving radiotherapy in LMIC, mechanisms for meeting these challenges, the different opportunities for participation by Medical Physicists, including students and residents, and how participation can be facilitated to increase AMPERE for global health.

CACM, 26 (11), 832-43

This book describes a theory of memory representation, organization, and processing for understanding complex narrative texts. The theory is implemented as a computer program called BORIS which reads and answers questions about divorce, legal disputes, personal favors, and the like. The system is unique in attempting to understand stories involving emotions and in being able to deduce adages and morals, in addition to answering fact and event based questions about the narratives it has read. BORIS also manages the interaction of many different knowledge sources such as goals, plans, scripts, physical objects, settings, interpersonal relationships, social roles, emotional reactions, and empathetic responses. The book makes several original technical contributions as well.

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.