Regular Article
Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories,☆☆

https://doi.org/10.1006/inco.1996.0042Get rights and content
Under an Elsevier user license
open archive

Abstract

This paper addresses the problem of systematically building a matching algorithm for the union of two disjoint theoriesE1E2provided that matching algorithms are known in both theoriesE1andE2. In general, the blind use of combination techniques introduces unification. Two different restrictions are considered in order to reduce this unification to matching. First, we show that combining matching algorithms (with linear constant restriction) is always sufficient for solving a pure fragment of combined matching problems. Second, the investigated method is complete for the largest class of theories where unification is not needed, including regular collapse-free theories and linear theories. Syntactic conditions are given to define this class of theories in which solving the combined matching problem is performed in a modular way.

Cited by (0)

final manuscript received February 1, 1996

☆☆

Revised version of a paper presented at the STACS'94 conference under the title “Combination of Matching Algorithms.”

f1

E-mail: [email protected]