Unification and Matching in Hierarchical Combinations of Syntactic Theories - Archive ouverte HAL Access content directly
Conference Papers Year :

Unification and Matching in Hierarchical Combinations of Syntactic Theories

(1) , (2) , (3) , (4) , (5)
1
2
3
4
5

Abstract

We investigate a hierarchical combination approach to the unification problem in non-disjoint unions of equational theories. In this approach, the idea is to extend a base theory with some additional axioms given by rewrite rules in such way that the unification algorithm known for the base theory can be reused without loss of completeness. Additional techniques are required to solve a combined problem by reducing it to a problem in the base theory. In this paper we show that the hierarchical combination approach applies successfully to some classes of syntactic theories, such as shallow theories since the required unification algorithms needed for the combination algorithm can always be obtained. We also consider the matching problem in syntactic extensions of a base theory. Due to the more restricted nature of the matching problem, we obtain several improvements over the unification problem.
Fichier principal
Vignette du fichier
combi-syntactic.pdf (342.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01206669 , version 1 (29-09-2015)

Identifiers

Cite

Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen. Unification and Matching in Hierarchical Combinations of Syntactic Theories. Frontiers of Combining Systems - 10th International Symposium, FroCoS 2015, Sep 2015, Wroclaw, Poland. pp.291--306, ⟨10.1007/978-3-319-24246-0_18⟩. ⟨hal-01206669⟩
121 View
127 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More