Complexity of the unification algorithm for first-order expressions
- 64 Downloads
Rewriting and comparisons are the complexity aspects of the unification algorithm which are considered in this paper. A simplified version of Robinson's algorithm  is described where rewriting (already linear in the size of the input in ) is reduced by a constant factor and the number of comparisons (exponential in the size of the input in ) is bounded by a quantity polynomial of quadratic order in the size of the input.
KeywordsFunction Symbol General Substitution Code Number Quadratic Order Complexity Aspect
Unable to display preview. Download preview PDF.
- Robison, J. A.,A machine-oriented logic based on the resolution principle, J. Ass. Comput. Mach.12, (1965), 23–41.Google Scholar
- Robinson, J. A.,Computational Logic: the unification computation, in Machine Intelligence6, 63–72.Google Scholar
- Benturini Zilli M., Cerimele M. M.,COR: a program for proving theorems in first-order logic, (unpublished).Google Scholar
- Venturini Zilli M.,Complessità dell'algoritmo di unificazione, in Proceedings of the Convegno di Informatica teorica, Mantova (1974), 87–96.Google Scholar