A Language for Writing Problem-Solving Programs

Citation

Rulifson, J. F., Waldinger, R. J., & Derksen, J. A. (1971). A language for writing problem-solving programs. SRI INTERNATIONAL MENLO PARK CA ARTIFICIAL INTELLIGENCE CENTER.

Abstract

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.


Read more from SRI

  • The US Capitol Dome

    Quantum on Capitol Hill

    The SRI-managed Quantum Economic Development Consortium convened quantum innovators and members of Congress to explore the future of quantum technology.

  • Rays of light

    Building the photonic circuits of the future

    SRI’s work on DARPA’s HAPPI program seeks to measurably advance the capability of circuits that transmit information using light rather than electrons.

  • Turning AI into a problem-solving teammate

    To chart the future of human-machine teaming, SRI’s COLLEAGUE project is building an AI-based system designed to act as a true collaborative partner.