Unification in commutative idempotent monoids

DOI10.1016/0304-3975(88)90140-5zbMath0658.68108OpenAlexW1996269215WikidataQ57383761 ScholiaQ57383761MaRDI QIDQ1111775

Franz Baader, Wolfram Buettner

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90140-5

zbMATH Keywords

commutative semigroupsunificationlogic programmingfunctional programmingautomatic theorem provingACI-unificationalgebraic theory of abstract data typesterm- rewrite systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (10)

Unification in varieties of idempotent semigroups ⋮ Unification, weak unification, upper bound, lower bound, and generalization problems ⋮ Unification in commutative semigroups ⋮ GUBS a Language for Synthetic Biology: Specification and Compilation ⋮ Unification properties of commutative theories: A categorical treatment ⋮ \(E\)-unification with constants vs. general \(E\)-unification ⋮ Unification theory ⋮ Unification in commutative theories ⋮ Unification problem in equational theories ⋮ Unification in free distributive lattices

Cites Work

• The theory of idempotent semigroups is of unification type zero
• Unification in varieties of idempotent semigroups
• Unification in abelian semigroups
• Embedding Boolean expressions into logic programming
• A Unification Algorithm for Associative-Commutative Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Unification in commutative idempotent monoids