论文信息 - Non-Deterministic Lisp with Dependency-directed Backtracking

Non-Deterministic Lisp with Dependency-directed Backtracking

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.

David A. McAllester | David Chapman | Ramin Zabih | R. Zabih | David Chapman

[1] John McCarthy,et al. A Basis for a Mathematical Theory of Computation , 1899 .

[2] John McCarthy,et al. A Basis for a Mathematical Theory of Computation1) , 1959 .

[3] Gerald J. Sussman,et al. Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis , 1976, Artif. Intell..

[4] Fernando Pereira,et al. Prolog - the language and its implementation compared with Lisp , 1977, Artificial Intelligence and Programming Languages.

[5] Jon Doyle,et al. AMORD: A Deductive Procedure System , 1978 .

[6] Jon Doyle. A truth maintenance system , 1981 .

[7] William D. Clinger. Nondeterministic call by need is neither lazy nor by name , 1982, LFP '82.

[8] Luís Moniz Pereira,et al. Deduction Revision by Intelligent Backtracking , 1984, Implementations of Prolog.

[9] Gerald J. Sussman,et al. Structure and interpretation of computer programs , 1985, Proceedings of the IEEE.

[10] Johan de Kleer,et al. Problem Solving with the ATMS , 1986, Artif. Intell..

[11] William D. Clinger,et al. Revised3 report on the algorithmic language scheme , 1986, SIGP.

[12] David Chapman,et al. Planning for Conjunctive Goals , 1987, Artif. Intell..

[13] Ramin Zabih,et al. Dependency-Directed Backtracking in Non-Deterministic Scheme , 1988 .