Unification problems with one-sided distributivity

DOI10.1016/S0747-7171(87)80026-3zbMath0638.68104MaRDI QIDQ1099650

Stefan Arnborg, Erik Tidén

Publication date: 1987

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

NP-hardunificationequational theoriesone-sided distributivityassociative unificationMarkov's problem

Mathematics Subject Classification ID

Related Items (15)

More problems in rewriting ⋮ Problems in rewriting III ⋮ An algorithm for distributive unification ⋮ “Syntactic” AC-unification ⋮ The complexity of counting problems in equational matching ⋮ Unification modulo homomorphic encryption ⋮ Bounded ACh unification ⋮ A partial solution for D-unification based on a reduction to AC 1-unification ⋮ Complexity of unification problems with associative-commutative operators ⋮ Unification modulo ACUI plus distributivity axioms ⋮ A decision algorithm for distributive unification ⋮ Unification problem in equational theories ⋮ On equational theories, unification, and (un)decidability ⋮ Unification Modulo Homomorphic Encryption ⋮ Terminating non-disjoint combined unification

Cites Work

• Algebra of communicating processes with abstraction
• Linear unification
• An Efficient Unification Algorithm
• Efficiency of a Good But Not Linear Set Union Algorithm
• Hilbert's Tenth Problem is Unsolvable
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Unification problems with one-sided distributivity