Publications
-
Robot Planning, Execution, and Monitoring in an Uncertain Environment
An intelligent robot, operating in an external environment that cannot be fully modeled in the robot's software, must be able to monitor the success of its execution of a previously…
-
A Language for Writing Problem-Solving Programs
This paper describes a language for constructing problem-solving programs that can manipulate several data structures, including ordered and unordered sets.
-
A Paradigm for Reasoning by Analogy
A paradigm enabling heuristic problem solving programs to exploit an analogy between a current unsolved problem and a similar but previously solved problem to simplify its search for a solution…
-
Reasoning by Analogy as an Aid to Heuristic Theorem Proving
In the paper, the correspondence between a new unsolved problem and a previously solved analogous problem is computed and invoked to tailor large data bases to manageable sizes.
-
ISUPPOSEW – A Computer Program That Finds Regions in the Plan Model of a Visual Scene
ISUPPOSEW is designed t o enable a robot to make conjectures, on the basis of its visual information, about elements of its environment that it cannot see.
-
The Application of Theorem Proving to Information Retrieval
We will describe an approach to combining and extending question-answering techniques to large data files using a compilation of widely used physical laws and effects of interest to both engineers…
-
On Program Synthesis and Program Verification
Certain similarities between program verification and program synthesis are pointed out. The analogy is illustrated using a "bubble-sort" program.
-
SRI – Trace Package for PDP-10 LISP
I’ve written a new LISP TRACE package which supersedes the current TRACE package.
-
An Information-Processing Model of Operant Behavior
In this note we shall sketch the outline of a simple information-processing model of operant behavior.
-
Towards Automatic Program Synthesis
An elementary outline of the theorem-proving approach to automatic program synthesis is given, without dwelling on technical details.
-
Robot Problem Solving* Without State Variables
Waldinger has proposed a scheme for getting around the original robot problem by extending the logic to handle sets and tuples (still keeping an explicit state variable around).
-
Scene Analysis Using Regions
The method employed uses regions as basic data and progresses by successive partitioning of the picture toward an interpretable "goal partition", which is then explored by a heuristic decision tree.