A Language for Writing Problem-solving Programs

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1971
Accession Number
ADA638147

Entities

People

  • Jan A. Derksen
  • Johns F. Rulifson
  • Richard J. Waldinger

Organizations

  • SRI International

Tags

Communities of Interest

  • Autonomy
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Air Force
  • Artificial Intelligence
  • Computer Languages
  • Computer Programming
  • Computer Programs
  • Computers
  • Contracts
  • Databases
  • Debugging
  • Formal Languages
  • Information Operations
  • Iterations
  • Language
  • Notation
  • Pattern Recognition
  • Simulations

Readers

  • Artificial Intelligence
  • Mathematical Modeling and Probability Theory.

Technology Areas

  • AI & ML
  • AI & ML - Information Retrieval
  • AI & ML - Machine Learning Algorithms
  • Autonomy