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).
|Original language||English (US)|
|Title of host publication||Foundations of Software Technology and Theoretical Computer Science - 6th Conference, Proceeding|
|Editors||Kesav V. Nori|
|Number of pages||16|
|State||Published - 1986|
|Event||6th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1986 - New Delhi, India|
Duration: Dec 18 1986 → Dec 20 1986
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||6th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1986|
|Period||12/18/86 → 12/20/86|
Bibliographical noteFunding Information:
1 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.
© 1986, Springer Verlag. All rights reserved.