So far, tractable planning problems reported in the literature have been defined by syntactical restrictions. To better exploit the inherent structure in problems, however, it is ...
We describe a new algorithm for table-driven parsing with context-free grammars designed to support efficient syntactic analysis of natural language. The algorithm provides a gene...
Conditional logics play an important role in recent attempts to investigate default reasoning. This paper investigates firstorder conditional logic. We show that, as for first-ord...
Intelligent artificial agents need to be able to explain and justify their actions. They must therefore understand the rationales for their own actions. This paper describes a tec...
In recent years, a number of different semantics for defaults have been proposed, such as preferential structures, semantics, possibilistic structures, and
Derivation replay was first proposed by Carbonell as a method of transferring guidancefrom a previousproblemsolving episode to a new one. Subsequent implementations have used stat...
To coordinate with other agents in its environment, an agent needs models of what the other agents are trying to do. When communication is impossible or expensive, this informatio...
Marcus J. Huber, Edmund H. Durfee, Michael P. Well...
Plan recognition techniques frequently make rigid assumptions about the student's plans, and invest substantial effort to infer unobservable properties of the student. The pe...