• Publications
  • Influence
The TRAINS project: a case study in building a conversational planning agent
TLDR
This paper describes the goals of the TRAINS project, and our experience with the effort so far. Expand
  • 374
  • 20
Monotonic Solution of the Frame Problem in the Situation Calculus: An Efficient Method for Worlds wi
The frame problem originally surfaced within McCarthy’s Situation Calculus [McCarthy68], when [McCarthy&Hayes69] applied it to reasoning about goal achievement. To illustrate their approach, theyExpand
  • 219
  • 7
The situations we talk about
I argue in favor of associating situations (events, episodes, eventualities, etc.) with arbitrarily complex sentences, not just atomic predicates, in NL interpretation. In that respect, a SituationExpand
  • 40
  • 7
  • PDF
Inferring State Constraints for Domain-Independent Planning
TLDR
We describe some new preprocessing techniques that enable faster domain-independent planning. Expand
  • 144
  • 5
  • PDF
Efficient Algorithms for Qualitative Reasoning about Time
TLDR
We address the problem of scalability in temporal reasoning by providing a collection of new algorithms for efficiently managing large sets of qualitative temporal relations. Expand
  • 85
  • 5
  • PDF
Extending The Expressive Power Of Semantic Networks
TLDR
Semantic networks present special problems with respect to the use of logical connectives, quantifiers, descriptions, and certain other constructions. Expand
  • 140
  • 4
  • PDF
Can we derive general world knowledge from texts
TLDR
We are attempting to exploit a largely untapped source of general knowledge in texts, lying at a level beneath the explicit assertional content. Expand
  • 123
  • 4
  • PDF
Episodic Logic Meets Little Red Riding Hood: A Comprehensive, Natural Representation for Language Un
TLDR
We describe a comprehensive framework for narrative understanding based on Episodic Logic (EL). Expand
  • 105
  • 4
  • PDF
An optimal algorithm for constructing the Delaunay triangulation of a set of line segments
TLDR
We show that the straight-line dual of the bounded Voronoi diagram of a set of non-intersecting line segments is the Delaunay triangulation of that set. Expand
  • 65
  • 4
Accelerating Partial-Order Planners: Some Techniques for Effective Search Control and Pruning
TLDR
We propose some domain-independent techniques for bringing well-founded partial-order planners closer to practicality. Expand
  • 96
  • 4
  • PDF