Non-deterministic lisp with dependency-directed backtracking

Authors:
Ramin Zabih;David McAllester;David Chapman
Affiliations:
Artificial Intelligence Laboratory, Massachusetts Institute of Technology;Artificial Intelligence Laboratory, Massachusetts Institute of Technology;Artificial Intelligence Laboratory, Massachusetts Institute of Technology
Venue:
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Year:
1987

Citing 6
Cited 0

Problem solving with the ATMS

Artificial Intelligence
Revised report on the algorithmic language scheme

ACM SIGPLAN Notices
Structure and interpretation of computer programs

Structure and interpretation of computer programs
Nondeterministic call by need is neither lazy nor by name

LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Prolog - the language and its implementation compared with Lisp

Proceedings of the 1977 symposium on Artificial intelligence and programming languages
Planning for Conjunctive Goals

Planning for Conjunctive Goals

Quantified Score

Hi-index	0.01

Visualization

Abstract

Extending functional Lisp with McCarthy's non-det erministic operator AMB yields a language which can concisely express search problems. Dependency-directed backtracking is a powerful search strategy. We describe a non-deterministic Lisp dialect called SCHEMER and show that it can provide automatic dependency-directed backtracking. The resulting language provides a convenient interface to this efficient backtracking strategy.