Backtracking in MLISP2: an efficient backtracking method for LISP
Proceedings of the Third International Joint Conference on Artificial Intelligence. Hardware and Software for A.I.. Pages 677-684.
Abstract
An efficient backtracking method for LISP, · used in the MLISP2 language, is described. The method is optimal in the following senses: ( 1) Only necessary state information is saved. The backtracking system routines are sufficiently efficient to require less than ten percent of the execution time of typical jobs . ( 2) Most common operations -- fetching/storing the value of a variable or the property of an atom, function entry/exit -take no longer with backtracking than without it. This is achieved by not changing the way values are stored. (3) If backtracking is not used, an insignificant overhead is involved in maintaining the backtracking capability. The MLISP2 algorithm and philosophy are briefly contrasted w i th those of several existing backtracking systems, with historical comments on the development of the theory of backtracking.
@inproceedings{ijcai1973p84,
title = {Backtracking in MLISP2: an efficient backtracking method for LISP},
author = {Smith, David Canfield and Enea, Horace J.},
booktitle = {Proceedings of the Third International Joint Conference on
Artificial Intelligence, {IJCAI-73}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Nils J. Nilsson},
pages = {677--684},
year = {1973},
month = {8},
note = {Hardware and Software for A.I.},
url = {https://ijcai.org/proceedings/1973/84},
}
TY - CPAPER TI - Backtracking in MLISP2: an efficient backtracking method for LISP AU - Smith, David Canfield AU - Enea, Horace J. T2 - Proceedings of the Third International Joint Conference on Artificial Intelligence, IJCAI-73 PB - International Joint Conferences on Artificial Intelligence PY - 1973 SP - 677 EP - 684 UR - https://ijcai.org/proceedings/1973/84 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
