Corpus ID: 16952940

Backtracking in MLISP2: an efficient backtracking method for LISP

@inproceedings{Smith1973BacktrackingIM,
  title={Backtracking in MLISP2: an efficient backtracking method for LISP},
  author={David Canfield Smith and Horace Enea},
  booktitle={IJCAI},
  year={1973}
}
  • David Canfield Smith, Horace Enea
  • Published in IJCAI 1973
  • Computer Science
  • 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… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 12 REFERENCES

    A H e u r i s t i c P r o g r a m fo r Solv ing P r o b l e m s S t a t e d as Nondetermin is t ic P r o c e d u r e s PH.D

    • R. E. Fikes
    • 1968
    VIEW 1 EXCERPT

    Backtrack Programming" J.ACM

    • Golomb, S.W, L. D. Baumert
    • {Oct
    • 1965

    I 8 P 2 Artificial Intelligence Project Memo AIM-195

    • D. C. Smith, Enea, L H.J.M
    • Stanford University,
    • 1973
    VIEW 1 EXCERPT

    Log i c f o r Computable Functions D e s c r i p t i o n Artificial Intelligence

    • R. Milner
    • 1972

    Nondeterministic Algorithms" J.ACM 14, A (Oct

    • R. W. Floyd
    • 1967

    Q A 4 P rog ramming Conoepts Al

    • J. F. Rulifson
    • Technical Note 60, Stanford Research Institute,
    • 1971