Hierarchical Combination

Abstract : A novel approach is described for the combination of unification algorithms for two equational theories E 1 and E 2 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".
Document type :
Conference papers
Complete list of metadatas

Contributor : Christophe Ringeissen <>
Submitted on : Wednesday, October 30, 2013 - 2:21:38 PM
Last modification on : Wednesday, June 26, 2019 - 3:18:22 PM

Links full text



Serdar Erbatur, Deepak Kapur, Andrew Marshall, Paliath Narendran, Christophe Ringeissen. Hierarchical Combination. CADE-24 - 24th International Conference on Automated Deduction - 2013, Jun 2013, Lake Placid, United States. pp.249-266, ⟨10.1007/978-3-642-38574-2_17⟩. ⟨hal-00878649⟩



Record views