Combining decision algorithms for matching in the union of disjoint equational theories

DOI10.1006/inco.1996.0042zbMath0853.68105OpenAlexW1995881795MaRDI QIDQ1917102

Christophe Ringeissen

Publication date: 12 January 1997

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6c9bad690d3a72660c446c663e46e566e0e826b1

zbMATH Keywords

matching algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (4)

Unification and Matching in Hierarchical Combinations of Syntactic Theories ⋮ Anti-patterns for rule-based languages ⋮ Unions of non-disjoint theories and combinations of satisfiability procedures ⋮ Unification algorithms cannot be combined in polynomial time.

This page was built for publication: Combining decision algorithms for matching in the union of disjoint equational theories