On the public citation graph
Adventures in associative-commutative unification (A summary)
0 signed · 29 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-15976-2_19openalex-snapshot
An algebraic approach to unification under associativity and commutativity
inferredcites →https://doi.org/10.1007/3-540-16780-3_140openalex-snapshot
RRL: A rewrite rule laboratory
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_12openalex-snapshot
Associative-Commutative Unification
inferredcites →https://doi.org/10.1007/bf00243792openalex-snapshot
A comparison of the variable-abstraction and constant-abstraction methods for associative-commutative unification
inferredcites →https://doi.org/10.1007/bf00245019openalex-snapshot
Non-negative integer basis algorithms for linear equations with integer coefficients
inferredcites →https://doi.org/10.1007/bf00246024openalex-snapshot
Unification in datastructure multisets
inferredcites →https://doi.org/10.1007/bf01442864openalex-snapshot
Ueber die Auflösung linearer Gleichungen mit reellen Coefficienten
inferredcites →https://doi.org/10.1016/0020-0190(78)90078-9openalex-snapshot
An algorithm to generate the basis of solutions to homogeneous linear diophantine equations
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferredcites →https://doi.org/10.1016/s0747-7171(89)80026-4openalex-snapshot
Adventures in associative-commutative unification
inferredcites →https://doi.org/10.1080/0020739x.2025.2512476openalex-snapshot
Solving linear Diophantine equations
inferredcites →https://doi.org/10.1145/322261.322262openalex-snapshot
A Unification Algorithm for Associative-Commutative Functions
inferredcites →https://doi.org/10.1145/357162.357169openalex-snapshot
An Efficient Unification Algorithm
inferredcites →https://doi.org/10.21236/ada015846openalex-snapshot
A Complete Unification Algorithm for Associative-Commutative Functions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45757-7_12openalex-snapshot
Complexity and Algorithms for the Matching of Bag and Set Terms
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_13openalex-snapshot
A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_136openalex-snapshot
Fast Knuth-Bendix completion: Summary
inferred← citeshttps://doi.org/10.1007/3-540-56039-4_58openalex-snapshot
Set-term matching in logic programming
inferred← citeshttps://doi.org/10.1007/bf00881866openalex-snapshot
Flatterms, discrimination nets, and fast term rewriting
inferred← citeshttps://doi.org/10.1007/bf00881905openalex-snapshot
Competing for theAC-Unification Race
inferred← citeshttps://doi.org/10.1007/bfb0030824openalex-snapshot
Set-term unification in a logic database language
inferred← citeshttps://doi.org/10.1007/bfb0031755openalex-snapshot
Unification of bounded simple set terms in deductive databases
inferred← citeshttps://doi.org/10.1007/bfb0034683openalex-snapshot
The complexity of weak unification of bounded simple set terms
inferred← citeshttps://doi.org/10.1016/0022-4049(95)00108-5openalex-snapshot
Infinite complete group presentations
inferred← citeshttps://doi.org/10.1023/a:1006019227709openalex-snapshot
An Algorithm for General Set Unification and Its Complexity
inferred← citeshttps://doi.org/10.1109/lics.1990.113755openalex-snapshot
A new AC unification algorithm with an algorithm for solving systems of diophantine equations
inferred← citeshttps://doi.org/10.1145/238355.238575openalex-snapshot
Optimal unification of bound simple set-terms
inferred← citeshttps://doi.org/10.1145/99370.99384openalex-snapshot
Using types as search keys in function libraries
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.