Abstract
A method for unification as the basis for intelligent backtracking in deduction systems is described. This method is based on the unification graphs introduced by Cox. In this paper, unification graphs are used in an extended form such that they represent all the information which can be gained from the unification constraints, i.e., the expression to be unified, their subterms which, as a consequence, are to be unified, the number of deduction steps which cause the unification of two terms, and the term-subterm relation as far as necessary. If a unification conflict occurs from this information, the deduction steps which have led to these conflicts can be determined and reset. This is done by searching for loop-free paths or loops with certain properties in the extended unification graph, according to the type of unification conflict. Algorithms for the handling of the unification graph and for the extraction information from it are described and proved as correct.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bruynooghe, M., ‘Analysis of dependencies to improve the behaviour of logic programs’ in Proc. 5th Conference on Automated Deduction, Lecture Notes in Computer Science 87, Springer, New York, 1980, pp. 293–305.
Bruynooghe, M. and Pereira, L. M., ‘Deduction revision by intelligent backtracking’, in J. A.Campbell (ed.), Implementations of PROLOG, Ellis Horwood, Chichester, 1984, pp. 194–215.
Cox, P. T. and Pietrzykowski, T., ‘Deduction plans: a basis for intelligent backtracking’, in IEEE Trans. on Pattern Analysis and Machine Intelligence, 3(1), 1981.
Cox, P. T., ‘On determining the causes of non-unifiability’, Auckland Computer Science Report No. 23, University of Auckland, 1981.
Dilger, W. and Janson, A., ‘A unification graph with constraints for intelligent backtracking in deduction systems’, Interner Bericht 100/84, Computer Science Department, University of Kaiserslautern.
Dilger, W. and Schneider, H.-A., ‘ASSIP-T. A theorem proving machine’, in Proceedings of the International Conference on Fifth Generation Computer Systems, Tokio, 1984, pp. 497–506.
Matwin, S. and Pietrzykowski, T., ‘Exponential improvement of exhaustive backtracking: a strategy for plan-based deduction’ in Proc. 6th Conference on Automated Deduction, Lecture Notes in Computer Science, Springer, New York, 1982, pp. 223–239.
Pereira, L. M. and Porto, A., ‘Selective backtracking for logic programs;’, in Proc. 5th Conference on Automated Deduction, Lecture Notes in Computer Science 87, Springer, New York, 1980, pp. 306–317.
Vasey, P. W., ‘A logic-in-logic interpreter’, MSc Thesis, Dept. of Computing and Control, Imperial College London, 1980.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dilger, W., Janson, A. Intelligent backtracking in deduction systems by means of extended unification graphs. J Autom Reasoning 2, 43–62 (1986). https://doi.org/10.1007/BF00246022
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00246022