Unification in commutative idempotent monoids

DOI10.1016/0304-3975(88)90140-5zbMath0658.68108WikidataQ57383761 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 semigroups; unification; logic programming; functional programming; automatic theorem proving; ACI-unification; algebraic theory of abstract data types; term- rewrite systems

Mathematics Subject Classification ID

68Q45: Formal languages and automata

20M35: Semigroups in automata theory, linguistics, etc.

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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