On the public citation graph
Opening the AC-unification race
0 signed · 77 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-12727-5_12openalex-snapshot
Complete sets of unifiers and matchers in equational theories
inferredcites →https://doi.org/10.1007/3-540-15976-2_15openalex-snapshot
Two results in term rewriting theorem proving
inferredcites →https://doi.org/10.1007/3-540-15976-2_18openalex-snapshot
Combining unification algorithms for confined regular equational theories
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-15984-3_296openalex-snapshot
Implementation of a general completion procedure parameterized by built-in theories and strategies
inferredcites →https://doi.org/10.1007/3-540-16780-3_110openalex-snapshot
Unification in combinations of collapse-free theories with disjoint sets of function symbols
inferredcites →https://doi.org/10.1007/3-540-16780-3_111openalex-snapshot
Combination of unification algorithms
inferredcites →https://doi.org/10.1007/3-540-16780-3_135openalex-snapshot
The markgraf karl refutation procedure (MKRP)
inferredcites →https://doi.org/10.1007/3-540-16780-3_140openalex-snapshot
RRL: A rewrite rule laboratory
inferredcites →https://doi.org/10.1007/3-540-17220-3_18openalex-snapshot
On equational theories, unification and decidability
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-71385-9_28openalex-snapshot
Lazy Theory Unification in Prolog: An Extension of the Warren Abstract Machine
inferredcites →https://doi.org/10.1007/978-3-642-73005-4_26openalex-snapshot
Theopogles — A Theorem Prover Based on First-Order Polynomials and a Special Knuth-Bendix Procedure
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/bf00244275openalex-snapshot
Automated deduction by theory resolution
inferredcites →https://doi.org/10.1007/bf00246024openalex-snapshot
Unification in datastructure multisets
inferredcites →https://doi.org/10.1007/bf00381143openalex-snapshot
Link inheritance in abstract clause graphs
inferredcites →https://doi.org/10.1007/bfb0012843openalex-snapshot
Adventures in associative-commutative unification (A summary)
inferredcites →https://doi.org/10.1007/bfb0012845openalex-snapshot
Unification in a combination of arbitrary disjoint equational theories
inferredcites →https://doi.org/10.1007/bfb0012853openalex-snapshot
Solving disequations in equational theories
inferredcites →https://doi.org/10.1007/bfb0012863openalex-snapshot
A new approach to universal unfication and its application to AC-unification
inferredcites →https://doi.org/10.1007/bfb0012877openalex-snapshot
Some tools for an inference laboratory (ATINF)
inferredcites →https://doi.org/10.1007/bfb0035864openalex-snapshot
Some tools for an inference laboratory (ATINF)
inferredcites →https://doi.org/10.1007/bfb0036919openalex-snapshot
Rewrite methods for clausal and non-clausal theorem proving
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/0304-3975(85)90011-8openalex-snapshot
A superposition oriented theorem prover
inferredcites →https://doi.org/10.1016/0304-3975(86)90175-1openalex-snapshot
Complete sets of unifiers and matchers in equational theories
inferredcites →https://doi.org/10.1016/b978-0-12-046371-8.50016-xopenalex-snapshot
Order-Sorted Equational Computation
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)80025-2openalex-snapshot
Efficient solution of linear diophantine equations
inferredcites →https://doi.org/10.1016/s0747-7171(89)80054-9openalex-snapshot
Unification in Boolean Rings and Abelian Groups
inferredcites →https://doi.org/10.1145/1012497.1012521openalex-snapshot
An equational approach to theorem proving in first-order predicate calculus
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.1145/800017.800519openalex-snapshot
Completion of a set of rules modulo a set of equations
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.1006/jsco.1996.0074openalex-snapshot
Paramodulation with Built-in AC-Theories and Symbolic Constraints
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_129openalex-snapshot
Consider only general superpositions in completion procedures
inferred← citeshttps://doi.org/10.1007/3-540-52531-9_130openalex-snapshot
Completion modulo associativity, commutativity and identity (AC1)
inferred← citeshttps://doi.org/10.1007/3-540-52531-9_137openalex-snapshot
AC-unification race: The system solving approach and its implementation
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_87openalex-snapshot
A resolution principle for clauses with constraints
inferred← citeshttps://doi.org/10.1007/3-540-54507-7_15openalex-snapshot
Automated deduction with associative commutative operators
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_50openalex-snapshot
On pot, pans and pudding or how to discover generalised critical Pairs
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_142openalex-snapshot
Computational complexity of simultaneous elementary matching problems
inferred← citeshttps://doi.org/10.1007/978-3-319-41842-1_11openalex-snapshot
What Is Essential Unification?
inferred← citeshttps://doi.org/10.1007/978-3-642-24933-4_15openalex-snapshot
Fast Sort Computations for Order-Sorted Matching and Unification
inferred← citeshttps://doi.org/10.1007/978-3-642-36675-8_5openalex-snapshot
MACE4 and SEM: A Comparison of Finite Model Generators
inferred← citeshttps://doi.org/10.1007/bf00245463openalex-snapshot
Complexity of unification problems with associative-commutative operators
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/bf00881829openalex-snapshot
Default reasoning by deductive planning
inferred← citeshttps://doi.org/10.1007/bf00881905openalex-snapshot
Competing for theAC-Unification Race
inferred← citeshttps://doi.org/10.1007/bf01270929openalex-snapshot
Automated deduction with associative-commutative operators
inferred← citeshttps://doi.org/10.1007/bf02090774openalex-snapshot
Unnecessary inferences in associative-commutative completion procedures
inferred← citeshttps://doi.org/10.1007/bf02733227openalex-snapshot
Unification problem in equational theories
inferred← citeshttps://doi.org/10.1007/bfb0012853openalex-snapshot
Solving disequations in equational theories
inferred← citeshttps://doi.org/10.1007/bfb0013176openalex-snapshot
Matching and unification for the object-oriented symbolic computation system AlgBench
inferred← citeshttps://doi.org/10.1007/bfb0016847openalex-snapshot
Modular AC unification of higher-order patterns
inferred← citeshttps://doi.org/10.1016/0004-3702(94)90027-2openalex-snapshot
A resolution principle for constrained logics
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90165-copenalex-snapshot
Termination and completion modulo associativity, commutativity and identity
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90040-aopenalex-snapshot
Compilation of set terms in the logic data language (LDL)
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-044450813-3/50014-xopenalex-snapshot
Solving Numerical Constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.11.026openalex-snapshot
On the parameterized complexity of associative and commutative unification
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00033-8openalex-snapshot
From situation calculus to fluent calculus: State update axioms as a solution to the inferential frame problem
inferred← citeshttps://doi.org/10.1023/a:1006136609427openalex-snapshot
Computational Complexity of Simultaneous Elementary Matching Problems
inferred← citeshttps://doi.org/10.1109/cmpsac.1989.65077openalex-snapshot
Expectations for associative-commutative unification speedups in a multicomputer environment
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.1142/9789812813411_0048openalex-snapshot
Logical Basis for the Automation of Reasoning: Case Studies
inferred← citeshttps://doi.org/10.1145/179812.179813openalex-snapshot
On solving equations and disequations
inferred← citeshttps://doi.org/10.3233/fi-1998-34302openalex-snapshot
Rule-Based Constraint Programming
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.