On the public citation graph
Unification in a combination of arbitrary disjoint equational theories
0 signed · 56 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-10009-1_25openalex-snapshot
Canonical forms and unification
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_116openalex-snapshot
Some relationships between unification, restricted unification, and matching
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_14openalex-snapshot
A New Equational Unification Method: A Generalisation of Martelli-Montanari’s Algorithm
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/bf00243792openalex-snapshot
A comparison of the variable-abstraction and constant-abstraction methods for associative-commutative unification
inferredcites →https://doi.org/10.1007/bf02328450openalex-snapshot
Unification under associativity and idempotence is of type nullary
inferredcites →https://doi.org/10.1007/bfb0036921openalex-snapshot
Incremental construction of unification algorithms in equational theories
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/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1016/c2013-0-02156-1openalex-snapshot
Computational Problems in Abstract Algebra
inferredcites →https://doi.org/10.1016/s0747-7171(87)80025-1openalex-snapshot
Unification in combinations of collapse-free regular theories
inferredcites →https://doi.org/10.1016/s0747-7171(89)80014-8openalex-snapshot
Basic narrowing revisited
inferredcites →https://doi.org/10.1016/s0747-7171(89)80057-4openalex-snapshot
Matching — A special case of unification?
inferredcites →https://doi.org/10.1090/conm/029/749246openalex-snapshot
Abelian group unification algorithms for elementary terms
inferredcites →https://doi.org/10.1145/2422.322411openalex-snapshot
Deciding Combinations of Theories
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
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/357162.357169openalex-snapshot
An Efficient Unification Algorithm
inferredcites →https://doi.org/10.22028/d291-42862openalex-snapshot
Unification Algorithms for Boolean Rings
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-45127-7_21openalex-snapshot
Matching with Free Function Symbols — A Simple Extension of Matching?
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_7openalex-snapshot
Combining Pattern E-Unification Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_60openalex-snapshot
Narrowing with built-in theories
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_118openalex-snapshot
Combining matching algorithms: The regular case
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_95openalex-snapshot
Unification in a combination of equational theories: an efficient algorithm
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_111openalex-snapshot
Constrained equational deduction
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_165openalex-snapshot
Unification in order-sorted algebras with overloading
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_38openalex-snapshot
A new approach to general E-unification based on conditional rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_16openalex-snapshot
T-string unification: Unifying prefixes in non-classical proof methods
inferred← citeshttps://doi.org/10.1007/978-94-009-0349-4_5openalex-snapshot
A New Correctness Proof of the Nelson-Oppen Combination Procedure
inferred← citeshttps://doi.org/10.1007/bf00881905openalex-snapshot
Competing for theAC-Unification Race
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.2009.07.037openalex-snapshot
Termination of narrowing revisited
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80145-9openalex-snapshot
Combining matching algorithms: The regular case
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80013-6openalex-snapshot
Boolean unification — The story so far
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80021-5openalex-snapshot
On equational theories, unification, and (Un)decidability
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80022-7openalex-snapshot
Unification in a combination of arbitrary disjoint equational theories
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80054-9openalex-snapshot
Unification in Boolean Rings and Abelian Groups
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80057-4openalex-snapshot
Matching — A special case of unification?
inferred← citeshttps://doi.org/10.1023/a:1009868906501openalex-snapshot
A Methodological View of Constraint Solving
inferred← citeshttps://doi.org/10.1093/jigpal/jzq009openalex-snapshot
Modular termination of basic narrowing and equational unification
inferred← citeshttps://doi.org/10.1109/lics.1988.5110openalex-snapshot
Unification in free extensions of Boolean rings and Abelian groups
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/96559.96569openalex-snapshot
Unification in primal algebras, their powers and their varieties
inferred← citeshttps://doi.org/10.26512/2017.03.d.24161openalex-snapshot
Unificação assimétrica módulo operadores nilpotentes com homomorfismo
inferred← citeshttps://doi.org/10.46298/dmtcs.270openalex-snapshot
Unification of Higher-order Patterns modulo Simple Syntactic Equational Theories
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.