A Language for Writing Problem-solving Programs

This paper describes a language for constructing problem-solving programs. The language can manipulate several data structures, including ordered and unordered sets. Pattern matching facilities may be used in various ways, including the binding of variables. Implicit backtracking facilitates the com...

Full description

Saved in:
Bibliographic Details
Main Authors: Rulifson, Johns F, Waldinger, Richard J, Derksen, Jan A
Format: Report
Language:English
Subjects:
Computer Programming and Software
Cybernetics
DATA BASES
PATTERN RECOGNITION
PATTERNS
PROBLEM SOLVING
PROGRAMMING LANGUAGES
ROBOTS
VARIABLES
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper describes a language for constructing problem-solving programs. The language can manipulate several data structures, including ordered and unordered sets. Pattern matching facilities may be used in various ways, including the binding of variables. Implicit backtracking facilitates the compact representation of search procedures. Expressions are treated analogously to atoms in LISP. A context device is used to implement variable bindings, to effect conditional proofs, and to solve the frame problem in robot planning. Paper accepted for presentation at IFIP Congress '71, Ljubljana, Yugoslavia, August 23-28, 1971. Sponsored in part by the Advanced Research Projects Agency and the National Aeronautics and Space Administration contract no. NASW-2086. Additional project no.: SRI-PN-8550.