Abstract
This paper presents a scheme for intelligent backtracking in Horn-clause logic programs. The scheme is simple and yet effective for backtracking within a clause. We also present a framework for using extra analysis to make within-clause-backtracking even more intelligent and also to perform across-the-clause backtracking intelligently. The primary strength of our scheme over other schemes is that it incurs very small overhead and yet can eliminate a lot of redundant backtracking. Our backtracking scheme can also be used when AND-parallelism is exploited in logic programs (i.e., when multiple literals of a clause are executed simultaneously).
This work was supported by Army Research Office grant #DAAG29-84-K-0060 to the Artificial Intelligence Laboratory at the University of Texas at Austin.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Bruynooghe and L. M. Pereira, Deduction Revision by Intelligent Backtracking, pp. 194–215 in Implementations of Prolog, ed. J. A. Campbell, Ellis Horwood Limited, 1984.
J.-H. Chang and A.M. Despain, Semi-Intelligent Backtracking of Prolog Based on a Static Data Dependency Analysis, Proceedings of IEEE Symposium on Logic Programming, pp. 10–21, August, 1985.
J.S. Conery and D.F. Kibler, AND Parallelism and Nondeterminism in Logic Programs, New Generation Computing 3(1985), pp. 43–70, OHMSHA,LTD. and Springer-Verlag, 1985.
P. Cox and T. Pietizylowski, Deduction Plans: a basis for intelligent backtracking, IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-3, 1, 1981.
Y.J. Lin and V. Kumar, An Execution Model for Exploiting AND-Parallelism in Logic Programs, Technical Report, AI Lab., Computer Science Dept., The University of Texas at Austin, Austin, Texas, March, 1986.
Y.J. Lin, V. Kumar, and C. Leung, An Intelligent Backtracking Algorithm for Parallel Execution of Logic Programs, the Third International Conference on Logic Programming, London, England, pp. 55–68, July, 1986.
S. Matwin and T. Pietrzylowski, Plan based deduction: data structures and implementation, Proceedings of 6th Conference on Automated Deduction, New York, Springer-Verlag, 1982.
L. M. Pereira and A. Porto, Selective Backtracking, pp. 107–114 in Logic Programming, ed. K. L. Clark and S.-A. Tarnlund, Academic Press, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, V., Lin, YJ. (1986). A framework for intelligent backtracking in logic programs. In: Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1986. Lecture Notes in Computer Science, vol 241. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17179-7_7
Download citation
DOI: https://doi.org/10.1007/3-540-17179-7_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17179-9
Online ISBN: 978-3-540-47239-1
eBook Packages: Springer Book Archive