There exists a large body of Artificial Intelligence (AI) research on generating plans, i.e., linear or nonlinear sequences of actions, to transform an initial world state to some desired goal state. However, much of the planning research to date has been complicated, ill-understood, and unclear.
An elementary outline of the theorem-proving approach to automatic program synthesis is given, without dwelling on technical details. The method is illustrated by the automatic construction of both recursive and iterative programs operating on natural numbers, lists, and trees.
Fernando C. N. Pereira, Douglas E. Appelt, & Paul Martin
This paper describes the design of a transportable natural language (NL) interface to databases and the constraints that transportability places on each components of such a system.
This paper describes initial work on a methodology for creating natural-language processing capabilities for new databases without the need for intervention by specially trained experts.
The DIALOGIC system for syntactic analysis and semantic translation has been under development for over ten years, and during that time it has been used in a number of domains in both database interface and message-processing applications.
We address recent criticisms of evidential reasoning, an approach to the analysis of imprecise and uncertain information that is based on the Dempster-Shafer calculus of evidence.
Typical bottom-up, forward-chaining reasoning systems such as hyperresolution lack goal-directedness while typical top-down, backward-chaining reasoning systems like Prolog or model elimination repeatedly solve the same goals.
