Dependency-Directed Backtracking in Non-Deterministic Scheme
Name
AITR-956.pdf
Size
3.69 MB
Format
Adobe PDF
Checksum (MD5)
83ded78c4a62e599c8c96ad8b2e00684
Author(s)
Zabih, Ramin
Date Issued
August 1988
Publisher
MIT Artificial Intelligence Laboratory
Series/Report no.
Technical Report;No. 956;
MIT Artificial Intelligence Laboratory Working Papers;WP-956;
Abstract
Non-deterministic LISP can be used to describe a search problem without specifying the method used to solve the problem. We show that SCHEMER, a non-deterministic dialect of SCHEME, can support dependency-directed backtracking as well as chronological backtracking. Full code for a working SCHEMER interpreter that provides dependency-directed backtracking is included.
Description
This is a greatly revised version of a thesis submitted to the Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science on January 2, 1987, in partial fulfillment of the requirements for the degree of Master of Science.
Persistent DSpace Link
