An algorithm for intelligent backtracking
We have proposed an intelligent backtracking method based on a search proof tree obtained from the connection graph of a Prolog program. Although our method is assured to be safe, i.e., never overlooks a solution path, it only points out the step from which the retrial of an altenative search may succeed. It can not indicate a promising step to return. Therefore further refinement of our intelligent backtracking method would have to consider possibilities of success as well as safe.
KeywordsSolution Path Variable Binding Prolog Program Connection Graph Occurrence Point
Unable to display preview. Download preview PDF.
- Bruynooghe, M.: "Analysis of Dependencies to Improve the Behavior Logic Prolog", 5th conf. on Automated Deduction, Lec. Note in Comp. Sci. Springer, 1980.Google Scholar
- Bruynooghe, M. and Pereira, L.M.: "Revision of Top-down Logical Reasoninig through Intelligent Backtracking", Departmento de Informatica, Universidade Nova de Lisboa, 1981.Google Scholar
- Chang, C.L. and Lee, R.C.T.: "Symbolic Logic and Mechanical Theorm Proving", Academic Press, 1973.Google Scholar
- Preira, L.M. and Porto, A.: "Selective Backtracking for Logic Programs", 5th conf. on Automated Deduction, Lec. Note in Comp. Sci. Springer, 1980.Google Scholar
- Lasserre, C. and Gallaire, H.: "Controlling Backtrack in Horn Clauses Programming", ACM Logic Programming Workshop, Budapest, 1980.Google Scholar