Abstract
The paper presents the data structure enabling an implementation of an efficient backtracking method for plan-based deduction. The structure consists of two parts. Static structure combines information about the initial set of clauses and unifiers. Dynamic structure records information about the history of the deduction process (plan graph), about the unifications built in this process (graph of constraints), and about the conflicts encountered. Dynamic structure consists purely of pointers and integers and is extremely economical.
The system operates on units. The units describe attempts to find the solution and reside on disk. A procedure controlling traffic of units between disk and memory and guaranteeing completeness of the search is presented. Some other procedures (development and pruning of plans, development of constraints graph and conflict detection) are also discussed.
The last section presents an example of a problem and follows its solution by a conventional PROLOG interpreter and by our system.
This work was supported by National Sciences and Engineering Research Council of Canada grants NO A5111 and E4450.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
L. D. Baxter, “A practically linear unification algorithm”, University of Waterloo, CS-76-13, 1976.
C. L. Chang, R. C. T. Lee, Symbolic Logic and Mechanical Theorem Proving”, NY, Academic Press, 1973.
P. T. Cox, “Representational Economy in Mechanical Theorem-Prover”, Proc. 4th Workshop in Automat. Deduction, Austin, TX, Feb. 1979.
P. T. Cox, “Deduction Plans: A Graphical Proof Procedure for the First-order Predicate Calculus”, Ph.D. dissertation, Dept. Computer Sci., University of Waterloo, 1977.
P. T. Cox, T. Pietrzykowski, “Deduction Plans: A Basis for Intelligent Backtracking”, IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol.3, Jan. 1981.
D. Forster, “GTP: A Graph-based Theorem Prover”, Master Thesis, University of Waterloo, 1980.
L. M. Pereira, F. C. N. Pereira, D. H. D. Warren, “User's Guide to DEC system-10 PROLOG”, LNEC, Lisbon, 1978.
L. M. Pereira, “Selective Backtracking for Logic Programs”, proceedings of CADE-5, Les Arcs, 1980.
T. Pietrzykowski, S. Matwin, “Exponential Improvement of Efficient Backtracking: A Strategy for Plan-based Deduction”, this volume.
G. Roberts, “Waterloo Prolog User's Manual”, University of Waterloo, 1980.
P. Roussel, “PROLOG: manuel de reference et d'utilization”, GIA, Marseille-Luminy, 1975.
D. H. D. Warren, Implementing PROLOG, Department of Artificial Intelligence, Edinburgh University, 1976.
P. T. Cox, “Deduction plans: A graphical proof procedure for the first-order predicate calculus ”Ph.D.dissertation, Dep. Comput. Sci., University of Waterloo, 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matwin, S., Pietrzykowski, T. (1982). Exponential improvement of exhaustive backtracking: data structure and implementation. In: Loveland, D.W. (eds) 6th Conference on Automated Deduction. CADE 1982. Lecture Notes in Computer Science, vol 138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000063
Download citation
DOI: https://doi.org/10.1007/BFb0000063
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11558-8
Online ISBN: 978-3-540-39240-8
eBook Packages: Springer Book Archive