Hierarchical Combination of Unification Algorithms

Serdar Erbatur 1 Deepak Kapur 2 Andrew Marshall 3 Paliath Narendran 4 Christophe Ringeissen 5
5 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : A critical question in unification theory is how to obtain a unification algorithm for the combination of non-disjoint equational theories when there exists unification algorithms for the constituent theories. The problem is known to be difficult and can easily be seen to be undecidable in the general case. Therefore, previous work has focused on identifying specific conditions and methods in which the problem is decidable. We continue the investigation in this paper, building on previous combination results. We are able to develop a novel approach to the non-disjoint combination problem. The approach is based on a new set of restrictions and combination method such that if the restrictions are satisfied the method produces an algorithm for the unification problem in the union of non-disjoint equational theories.
Document type :
Conference papers
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/hal-00920509
Contributor : Christophe Ringeissen <>
Submitted on : Wednesday, December 18, 2013 - 3:52:28 PM
Last modification on : Tuesday, August 13, 2019 - 11:32:01 AM
Long-term archiving on : Wednesday, March 19, 2014 - 5:52:01 AM

File

Hierarchical.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00920509, version 1

Citation

Serdar Erbatur, Deepak Kapur, Andrew Marshall, Paliath Narendran, Christophe Ringeissen. Hierarchical Combination of Unification Algorithms. The 27th International Workshop on Unification (UNIF 2013), Jun 2013, Eindhoven, Netherlands. ⟨hal-00920509⟩

Share

Metrics

Record views

292

Files downloads

129