Hierarchical combination

Authors:
Serdar Erbatur;Deepak Kapur;Andrew M. Marshall;Paliath Narendran;Christophe Ringeissen
Affiliations:
Dipartimento di Informatica, Università degli Studi di Verona, Italy;University of New Mexico;Naval Research Laboratory;University at Albany, SUNY;LORIA --- INRIA Nancy-Grand Est, France
Venue:
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Year:
2013

Citing 18
Cited 0

Unification in combinations of collapse-free theories with disjoint sets of function symbols

Proc. of the 8th international conference on Automated deduction
Unification in combinations of collapse-free regular theories

Journal of Symbolic Computation
On equational theories, unification, and (Un)decidability

Journal of Symbolic Computation
Unification in a combination of arbitrary disjoint equational theories

Journal of Symbolic Computation
Complete sets of transformations for general E-unification

Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
A proof theory for general unification

A proof theory for general unification
An improved general E-unification method

Journal of Symbolic Computation
Combining unification algorithms

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

Journal of Symbolic Computation
Term rewriting and all that

Term rewriting and all that
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
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
Combining Equational Theories Sharing Non-Collapse-Free Constructors

FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
Combining Decision Procedures for Positive Theories Sharing Constructors

RTA '02 Proceedings of the 13th 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
General E-unification with Eager Variable Elimination and a Nice Cycle Rule

Journal of Automated Reasoning
Unification modulo chaining

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Unification modulo synchronous distributivity

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

A novel approach is described for the combination of unification algorithms for two equational theories E1 and E2 which share function symbols. We are able to identify a set of restrictions and a combination method such that if the restrictions are satisfied the method produces a unification algorithm for the union of non-disjoint equational theories. Furthermore, we identify a class of theories satisfying the restrictions. The critical characteristics of the class is the hierarchical organization and the shared symbols being restricted to "inner constructors".