Associative unification in Maude

Semantic unification has been much studied since the early days of automated reasoning, and theories such as commutativity and associativity-commutativity (AC) have been built into a number of theorem provers and term rewriting engines. Associativity, which captures the notion of lists, might be con...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of logical and algebraic methods in programming Ročník 126; s. 100747
Hlavní autor: Eker, Steven
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.04.2022
Témata:
Associativity
Maude
Semigroup
Unification
Maude
Semigroup
Associativity
Unification
ISSN:2352-2208
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í:Semantic unification has been much studied since the early days of automated reasoning, and theories such as commutativity and associativity-commutativity (AC) have been built into a number of theorem provers and term rewriting engines. Associativity, which captures the notion of lists, might be considered even more basic than AC, which captures the notion of multisets. However despite being decidable, associative unification has not been widely implemented in general purpose systems, due to its infinitary nature and the high complexity of available algorithms. In this paper we describe the support for associative unification implemented in the Maude system, which is incomplete, but handles many useful cases and smoothly combines with other supported theories.
ISSN:2352-2208
DOI:10.1016/j.jlamp.2021.100747