A general complete E-unification procedure
- 1 January 1987
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 216-227
- https://doi.org/10.1007/3-540-17220-3_19
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Complete sets of unifiers and matchers in equational theoriesTheoretical Computer Science, 1986
- Universal UnificationPublished by Springer Nature ,1984
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Positive First-Order Logic Is NP-CompleteIBM Journal of Research and Development, 1981
- Linear unificationJournal of Computer and System Sciences, 1978
- Logical WritingsPublished by Springer Nature ,1971
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- A formulation of the simple theory of typesThe Journal of Symbolic Logic, 1940