Non-Deterministic Lisp with Dependency-Directed Backtracking

Abstract

Extending functional Lisp with McCarthy's nondeterministic 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.

Cite

Text

Zabih et al. "Non-Deterministic Lisp with Dependency-Directed Backtracking." AAAI Conference on Artificial Intelligence, 1987.

Markdown

[Zabih et al. "Non-Deterministic Lisp with Dependency-Directed Backtracking." AAAI Conference on Artificial Intelligence, 1987.](https://mlanthology.org/aaai/1987/zabih1987aaai-non/)

BibTeX

@inproceedings{zabih1987aaai-non,
  title     = {{Non-Deterministic Lisp with Dependency-Directed Backtracking}},
  author    = {Zabih, Ramin and McAllester, David A. and Chapman, David},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1987},
  pages     = {59-65},
  url       = {https://mlanthology.org/aaai/1987/zabih1987aaai-non/}
}