English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

Unification in extensions of shallow equational theories

MPS-Authors
/persons/resource/persons44688

Jacquemard,  Florent
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44784

Meyer,  Christoph
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45719

Weidenbach,  Christoph       
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

MPI-I-98-2-002.pdf
(Any fulltext), 46MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Jacquemard, F., Meyer, C., & Weidenbach, C.(1998). Unification in extensions of shallow equational theories (MPI-I-1998-2-002). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-7B57-C
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.