Combining Decision Procedures for Positive Theories Sharing Constructors

Authors:
Franz Baader;Cesare Tinelli
Affiliations:
-;-
Venue:
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Year:
2002

Citing 9
Cited 3

Unification in a combination of arbitrary disjoint equational theories

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

Journal of Symbolic Computation
A Unification Algorithm for Associative-Commutative Functions

Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
Unions of non-disjoint theories and combinations of satisfiability procedures

Theoretical Computer Science
Combination of Constraint Solving Techniques: An Algebraic POint of View

RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Combination Techniques for Non-Disjoint Equational Theories

CADE-12 Proceedings of the 12th 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

A Tableau Calculus for Combining Non-disjoint Theories

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Model-Theoretic Methods in Combined Constraint Satisfiability

Journal of Automated Reasoning
Hierarchical combination

CADE'13 Proceedings of the 24th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the following combination problem: given two equational theories E1 and E2 whose positive theories are decidable, how can one obtain a decision procedure for the positive theory of E1 驴 E2 For theories over disjoint signatures, this problem was solved by Baader and Schulz in 1995. This paper is a first step towards extending this result to the case of theories sharing constructors. Since there is a close connection between positive theories and unification problems, this also extends to the non-disjoint case the work on combining decision procedures for unification modulo equational theories.