Average-case analysis of unification algorithms
- 24 May 1993
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 113 (1) , 3-34
- https://doi.org/10.1016/0304-3975(93)90208-b
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Singularity Analysis of Generating FunctionsSIAM Journal on Discrete Mathematics, 1990
- Complete sets of transformations for general E-unificationTheoretical Computer Science, 1989
- Average-case analysis of Robinson's unification algorithm with two different variablesInformation Processing Letters, 1989
- On the sequential nature of unificationThe Journal of Logic Programming, 1984
- Fundamental properties of infinite treesTheoretical Computer Science, 1983
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Combinatorial aspects of continued fractionsDiscrete Mathematics, 1980
- Linear unificationJournal of Computer and System Sciences, 1978
- Complexity of the unification algorithm for first-order expressionsCalcolo, 1975
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965