Order-sorted Equational Unification Revisited

This paper presents a rule-based algorithm for performing order-sorted E-unification using an unsorted E-unification decision procedure under assumptions about E that are commonly satisfied in practice. We have implemented this algorithm in Maude for use with the Maude-NRL protocol analyzer and have...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Electronic notes in theoretical computer science Ročník 290; s. 37 - 50
Hlavní autoři:	Hendrix, Joe, Meseguer, José
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 20.12.2012
Témata:	Order-sorted unification rule-based programming Order-sorted unification rule-based programming
ISSN:	1571-0661, 1571-0661
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	This paper presents a rule-based algorithm for performing order-sorted E-unification using an unsorted E-unification decision procedure under assumptions about E that are commonly satisfied in practice. We have implemented this algorithm in Maude for use with the Maude-NRL protocol analyzer and have used CiME for unsorted E-unification for E any set of AC and ACU axioms. In many examples of interest, using order-sorted unification over unsorted unification is able to reduce the total number of unifiers considered, and dramatically improve the performance of the Maude-NRL tool.
ISSN:	1571-0661 1571-0661
DOI:	10.1016/j.entcs.2012.11.010