Unification in Extensions of Shallow Equational Theories - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1998

Unification in Extensions of Shallow Equational Theories

Abstract

We show that unification in certain extensions of shallow equational theories is decidable. Our extensions generalize the known classes of shallow or standard equational theories. In order to prove decidability of unification in the extensions, a class of Horn clause sets called sorted shallow equational theories is introduced. This class is a natural extension of tree automata with equality constraints between brother subterms as well as shallow sort theories. We show that saturation under sorted superposition is effective on sorted shallow equational theories. So called semi-linear equational theories can be effectively transformed into equivalent sorted shallow equational theories and generalize the classes of shallow and standard equational theories.
Fichier principal
Vignette du fichier
98-R-387.pdf (364.78 Ko) Télécharger le fichier

Dates and versions

inria-00098740 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00098740 , version 1

Cite

Florent Jacquemard, Christoph Meyer, Christoph Weidenbach. Unification in Extensions of Shallow Equational Theories. [Intern report] 98-R-387 || jacquemard98a, 1998, 33 p. ⟨inria-00098740⟩
87 View
145 Download

Share

Gmail Facebook Twitter LinkedIn More