Dependency-Directed Backtracking in Non-Deterministic Scheme

dc.contributor.author	Zabih, Ramin
dc.date.accessioned	2009-09-14T03:49:15Z
dc.date.available	2009-09-14T03:49:15Z
dc.date.issued	1988-08
dc.identifier.uri	http://hdl.handle.net/1721.1/46712
dc.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.	en
dc.description.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.	en
dc.description.sponsorship	MIT Artificial Intelligence Laboratory	en
dc.language.iso	en_US	en
dc.publisher	MIT Artificial Intelligence Laboratory	en
dc.relation.ispartofseries	Technical Report;No. 956;
dc.relation.ispartofseries	MIT Artificial Intelligence Laboratory Working Papers;WP-956;
dc.title	Dependency-Directed Backtracking in Non-Deterministic Scheme	en
dc.type	Working Paper	en