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\)

From MaRDI portal

Revision as of 00:21, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1187854

Jump to:navigation, search

DOI10.1007/BF00263448zbMath0768.68068OpenAlexW292843929MaRDI QIDQ1187854

Eric Domenjoud

Publication date: 23 July 1992

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00263448

zbMATH Keywords

Diophantine equation AC-unification minimal unifiers Stickel's equation

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Linear Diophantine equations (11D04)

Related Items (5)

The complexity of counting problems in equational matching ⋮ What Is Essential Unification? ⋮ AC-superposition with constraints: No AC-unifiers needed ⋮ Unification problem in equational theories ⋮ ELAN from a rewriting logic point of view

This page was built for publication: 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\)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1187854&oldid=12063808"