A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Automata-driven efficient subterm unification
2001
Theoretical Computer Science
Syntactic uniÿcation has widespread use in computing. There are several operations used in deductive computing such as critical pair generation, paramodulation and narrowing that require unifying a term s with every subterm of another term p. This subterm uniÿcation problem can be solved naively by repeatedly unifying s with each subterm of p in isolation. The drawback of doing uniÿcation in isolation is that commonality among subterms of p is ignored. We present an algorithm for e cient
doi:10.1016/s0304-3975(99)00131-0
fatcat:aehivjrbhfayhou4k2cgiw42ma