Deciding the Word Problem in the Union of Equational Theories Sharing Constructors

Authors:
Franz Baader;Cesare Tinelli
Affiliations:
-;-
Venue:
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Year:
1999

Citing 12
Cited 1

Combining unification algorithms

Journal of Symbolic Computation
Combining symbolic constraint solvers on algebraic domains

Journal of Symbolic Computation
Modular properties of composable term rewriting systems

Journal of Symbolic Computation
Unification in the union of disjoint equational theories: combining decision procedures

Journal of Symbolic Computation
Proving termination with multiset orderings

Communications of the ACM
Unification in a Combination of Equational Theories with Shared Constants and its Application to Primal Algebras

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Combination of Matching Algorithms

STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Combining Matching Algorithms: The Rectangular Case

RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Combination Techniques for Non-Disjoint Equational Theories

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
A New Approach for Combining Decision Procedure for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Deciding the Word Problem in the Union of Equational Theories

Deciding the Word Problem in the Union of Equational Theories
Non-Disjoint Unions of Theories and Combinations of Satisfiability Procedures: First Results

Non-Disjoint Unions of Theories and Combinations of Satisfiability Procedures: First Results

Unions of non-disjoint theories and combinations of satisfiability procedures

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main contribution of this paper is a new method for combining decision procedures for the word problem in equational theories sharing "constructors." The notion of constructors adopted in this paper has a nice algebraic definition and is more general than a related notion introduced in previous work on the combination problem.