In this paper we present optimal processor x time parallel algorithms for term matching and anti-unification of terms represented as trees. Term matching is ...

Efficient Parallel Term Matching. Arthur L. Delcher. Simon Kasif. Computer ... In this paper we address the problems of term-matching and anti-unification.

In this paper we present optimal processor x time parallel algorithms for term matching and anti-unification of terms represented as trees.

Anti-Unification of Two Terms. Given two terms t₁ ... mally solving the forest and term matching problems ... matching on parallel computers. In Proc ...

Bibliographic details on Efficient Parallel Term Matching and Anti-Unification.

Parallel algorithms and computational complexity results are given for two problems; computing the relative complement of terms and antiunification.

Abstract: In this paper we present optimal processor x time parallel algorithms for term matching and anti-unification of terms represented as trees. Term ...

Delcher and S. Kasif. Efficient parallel term matching and anti-unification. J. Autom. Reasoning, 9(3):391–406, 1992.

Efficient parallel term matching and anti-unification. Arthur L. Delcher; Simon Kasif. OriginalPaper Pages: 391 - 406. The problem of demodulating across ...

Efficient parallel term matching and anti-unification · A Machine-Oriented Logic Based on the Resolution Principle · Parallel Algorithms for Term Matching · An ...