On the relationship of congruence closureand unification
- 30 April 1989
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 7 (3-4) , 427-444
- https://doi.org/10.1016/s0747-7171(89)80018-5
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Term matching on parallel computersPublished by Springer Nature ,1987
- A parallel algorithm for the monadic unification problemBIT Numerical Mathematics, 1985
- On the sequential nature of unificationThe Journal of Logic Programming, 1984
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Reasoning About Recursively Defined Data StructuresJournal of the ACM, 1980
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980
- Assignment Commands with Array ReferencesJournal of the ACM, 1978
- The circuit value problem is log space complete for PACM SIGACT News, 1975
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965