On the public citation graph
Unification in Abelian semigroups
0 signed · 69 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/978-0-387-34768-4_12openalex-snapshot
Associative-Commutative Unification
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_15openalex-snapshot
A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering that x 3 = x Implies Ring Commutativity
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
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.1007/bf02328450openalex-snapshot
Unification under associativity and idempotence is of type nullary
inferredcites →https://doi.org/10.1007/bf02328451openalex-snapshot
The theory of idempotent semigroups is of unification type zero
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.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/322248.322251openalex-snapshot
Complete Sets of Reductions for Some Equational Theories
inferredcites →https://doi.org/10.1145/322261.322262openalex-snapshot
A Unification Algorithm for Associative-Commutative Functions
inferredcites →https://doi.org/10.21236/ada015846openalex-snapshot
A Complete Unification Algorithm for Associative-Commutative Functions
inferredcites →https://doi.org/10.2307/2370405openalex-snapshot
Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1999.2855openalex-snapshot
Unification Algorithms Cannot Be Combined in Polynomial Time
inferred← citeshttps://doi.org/10.1006/jabr.1997.7212openalex-snapshot
Unification in Commutative Semigroups
inferred← citeshttps://doi.org/10.1006/jsco.1996.0009openalex-snapshot
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures
inferred← citeshttps://doi.org/10.1007/11679219_5openalex-snapshot
Eliminating Implicit Information Leaks by Transformational Typing and Unification
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_112openalex-snapshot
Unification in the data structure sets
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_118openalex-snapshot
Unification in many-sorted equational theories
inferred← citeshttps://doi.org/10.1007/3-540-45719-4_18openalex-snapshot
Bisimulation by Unification*
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_2openalex-snapshot
On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_89openalex-snapshot
AC unification through order-sorted AC1 unification
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_155openalex-snapshot
Unification in the union of disjoint equational theories: Combining decision procedures
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_107openalex-snapshot
A partial solution for D-unification based on a reduction to AC 1-unification
inferred← citeshttps://doi.org/10.1007/3-540-60299-2_1openalex-snapshot
Complete solving of linear Diophantine equations and inequations without adding variables
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_40openalex-snapshot
AC-complete unification and its application to theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_89openalex-snapshot
Unification algorithms cannot be combined in polynomial time
inferred← citeshttps://doi.org/10.1007/978-3-642-71145-9_8openalex-snapshot
On the Unification Hierarchy
inferred← citeshttps://doi.org/10.1007/bf00243792openalex-snapshot
A comparison of the variable-abstraction and constant-abstraction methods for associative-commutative unification
inferred← citeshttps://doi.org/10.1007/bf00245463openalex-snapshot
Complexity of unification problems with associative-commutative operators
inferred← citeshttps://doi.org/10.1007/bf00246024openalex-snapshot
Unification in datastructure multisets
inferred← citeshttps://doi.org/10.1007/bf00263448openalex-snapshot
A technical note on AC-Unification. The number of minimal unifiers of the equation ?x1 + ? + ?xp ?AC ?y1 + ? + ?yq
inferred← citeshttps://doi.org/10.1007/bf00881887openalex-snapshot
Unification in partially commutative semigroups
inferred← citeshttps://doi.org/10.1007/bf02733227openalex-snapshot
Unification problem in equational theories
inferred← citeshttps://doi.org/10.1007/bfb0012845openalex-snapshot
Unification in a combination of arbitrary disjoint equational theories
inferred← citeshttps://doi.org/10.1007/bfb0012853openalex-snapshot
Solving disequations in equational theories
inferred← citeshttps://doi.org/10.1007/bfb0016847openalex-snapshot
Modular AC unification of higher-order patterns
inferred← citeshttps://doi.org/10.1007/s10207-007-0016-zopenalex-snapshot
Transformational typing and unification for automatically correcting insecure programs
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90140-5openalex-snapshot
Unification in commutative idempotent monoids
inferred← citeshttps://doi.org/10.1016/0747-7171(92)90025-yopenalex-snapshot
AC-unification race: The system solving approach, implementation and benchmarks
inferred← citeshttps://doi.org/10.1016/b978-0-12-046371-8.50012-2openalex-snapshot
From Unification in Combination of Equational Theories to a New AC-Unification Algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.004openalex-snapshot
A semantic framework for open processes
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00195-8openalex-snapshot
Avoiding slack variables in the solving of linear diophantine equations and inequations
inferred← citeshttps://doi.org/10.1016/s0747-7171(19)80001-9openalex-snapshot
AC Unification Through Order-Sorted AC1 Unification
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80001-9openalex-snapshot
An algebraic approach to unification under associativity and commutativity
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80004-4openalex-snapshot
Associative-commutative unification
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80065-2openalex-snapshot
Embedding boolean expressions into logic programming
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80025-2openalex-snapshot
Efficient solution of linear diophantine equations
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80026-4openalex-snapshot
Adventures in associative-commutative unification
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80037-9openalex-snapshot
Unification in permutative equational theories is undecidable
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80123-9openalex-snapshot
Rewriting Logic as a Framework for Generic Verification Tools
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.1109/lics.1992.185515openalex-snapshot
Double-exponential complexity of computing a complete set of AC-unifiers
inferred← citeshttps://doi.org/10.1112/jlms/s2-48.1.52openalex-snapshot
The Undecidability of the Unification Problem for Nilpotent Groups of Class ⩾ 5
inferred← citeshttps://doi.org/10.1145/179812.179813openalex-snapshot
On solving equations and disequations
inferred← citeshttps://doi.org/10.22028/d291-40236openalex-snapshot
Reducing the Derivation of Redundant Clauses in Reasoning Systems
inferred← citeshttps://doi.org/10.3103/s0278641925700177openalex-snapshot
Unification Problem for Finite State Parameterized Transducers
inferred← citeshttps://doi.org/10.3929/ethz-a-005515703openalex-snapshot
Formal approaches to countering side-channel attacks
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.