A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2001; you can also visit the original URL.
The file type is application/pdf
.
Tractable and intractable second-order matching problems
2004
Journal of symbolic computation
The second-order matching problem is the problem of determining, for a finite set { ti, si | i ∈ I} of pairs of a second-order term ti and a first-order closed term si, called a matching expression, whether or not there exists a substitution σ such that tiσ = si for each i ∈ I. It is well-known that the second-order matching problem is NP-complete. In this paper, we introduce the following restrictions of a matching expression: k-ary, k-fv , predicate, ground, and function-free. Then, we show
doi:10.1016/j.jsc.2003.09.002
fatcat:c3mvlslzrzdbrexciaqbxd6uau