A completeness result for E-unification algorithms based on conditional narrowing

23Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Giovannetti, E., & Moiso, C. (1988). A completeness result for E-unification algorithms based on conditional narrowing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 306 LNCS, pp. 157–167). Springer Verlag. https://doi.org/10.1007/3-540-19129-1_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free