Unification problem in equational theories
From MaRDI portal
Publication:1280985
DOI10.1007/BF02733227zbMath0919.68116MaRDI QIDQ1280985
Publication date: 15 March 1999
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unification under associativity and idempotence is of type nullary
- The theory of idempotent semigroups is of unification type zero
- Unification in commutative theories
- Unification in a combination of arbitrary disjoint equational theories
- Hilbert's tenth problem is of unification type zero
- Unification in abelian semigroups
- Complexity of matching problems
- Unification problems with one-sided distributivity
- Embedding Boolean expressions into logic programming
- Unification in commutative idempotent monoids
- Efficient solution of linear diophantine equations
- A technical note on AC-unification. The number of minimal unifiers of the equation \(\alpha x_ 1+ \cdots + \alpha x_ p \doteq _{AC} \beta y_ 1+ \cdots + \beta y_ q\)
- Complexity of the unification algorithm for first-order expressions
- A unification algorithm for typed \(\overline\lambda\)-calculus
- Linear unification
- Boolean unification - the story so far
- Minimal and complete word unification
- The undecidability of the DA-unification problem
- A Unification Algorithm for Associative-Commutative Functions
- An Efficient Unification Algorithm
- A Machine-Oriented Logic Based on the Resolution Principle
- DIOPHANTINE SETS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Unification problem in equational theories
