Login

Dependency-Directed Backtracking in Non-Deterministic Scheme

Show full item record




Title: Dependency-Directed Backtracking in Non-Deterministic Scheme
Author: Zabih, Ramin
Publisher: MIT Artificial Intelligence Laboratory
Issue Date: 1988-08
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.
URI: http://hdl.handle.net/1721.1/46712
Series/Report no.: Technical Report;No. 956;, MIT Artificial Intelligence Laboratory Working Papers;WP-956;

Files in this item

Files Size Format
AITR-956.pdf 3.866Mb application/pdf

This item appears in the following Collection(s)

Show full item record

Search DSpace@MIT


Advanced Search

Browse

My Account

Links