On the public citation graph
Complexity of unification problems with associative-commutative operators
0 signed · 95 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-16780-3_113openalex-snapshot
NP-completeness of the set unification and matching problems
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/bf02575010openalex-snapshot
Unification in varieties of idempotent semigroups
inferredcites →https://doi.org/10.1016/0743-1066(84)90014-1openalex-snapshot
Linear-time algorithms for testing the satisfiability of propositional horn formulae
inferredcites →https://doi.org/10.1016/0890-5401(90)90023-bopenalex-snapshot
On ground-confluence of term rewriting systems
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50028-xopenalex-snapshot
Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.
inferredcites →https://doi.org/10.1016/s0747-7171(87)80001-9openalex-snapshot
An algebraic approach to unification under associativity and commutativity
inferredcites →https://doi.org/10.1016/s0747-7171(87)80004-4openalex-snapshot
Associative-commutative unification
inferredcites →https://doi.org/10.1016/s0747-7171(87)80026-3openalex-snapshot
Unification problems with one-sided distributivity
inferredcites →https://doi.org/10.1016/s0747-7171(87)80027-5openalex-snapshot
Complexity of matching problems
inferredcites →https://doi.org/10.1137/0214004openalex-snapshot
The Complexity of Distributed Concurrency Control
inferredcites →https://doi.org/10.1145/321850.321859openalex-snapshot
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
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/36330.36332openalex-snapshot
Matching, unification and complexity
inferredcites →https://doi.org/10.1145/800105.803406openalex-snapshot
Complexity of finitely presented algebras
inferredcites →https://doi.org/10.21236/ada015846openalex-snapshot
A Complete Unification Algorithm for Associative-Commutative Functions
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
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.2849openalex-snapshot
Complexity of Nilpotent Unification and Matching Problems
inferred← citeshttps://doi.org/10.1006/inco.1999.2855openalex-snapshot
Unification Algorithms Cannot Be Combined in Polynomial Time
inferred← citeshttps://doi.org/10.1006/jsco.1995.1054openalex-snapshot
The Complexity of Counting Problems in Equational Matching
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.1006/jsco.1996.0074openalex-snapshot
Paramodulation with Built-in AC-Theories and Symbolic Constraints
inferred← citeshttps://doi.org/10.1006/jsco.2002.0536openalex-snapshot
Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part I)
inferred← citeshttps://doi.org/10.1007/10720084_15openalex-snapshot
Why Combined Decision Problems Are Often Intractable
inferred← citeshttps://doi.org/10.1007/3-540-45446-2_27openalex-snapshot
E-unifiability via Narrowing
inferred← citeshttps://doi.org/10.1007/3-540-45650-3_30openalex-snapshot
An Efficient Derivation for Elementary Formal Systems Based on Partial Unification
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_35openalex-snapshot
Unification Modulo Associativity and Idempotency Is NP-complete
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-55602-8_155openalex-snapshot
Unification in the union of disjoint equational theories: Combining decision procedures
inferred← citeshttps://doi.org/10.1007/3-540-56730-5_29openalex-snapshot
General A- and AX-unification via optimized combination procedures
inferred← citeshttps://doi.org/10.1007/3-540-56868-9_23openalex-snapshot
Combination techniques and decision problems for disunification
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_40openalex-snapshot
AC-superposition with constraints: No AC-unifiers needed
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_41openalex-snapshot
The complexity of counting problems in equational matching
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_60openalex-snapshot
An algorithm for distributive unification
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_90openalex-snapshot
Unification and matching modulo nilpotence
inferred← citeshttps://doi.org/10.1007/3-540-62950-5_78openalex-snapshot
A criterion for intractability of E-unification with free function symbols and its relevance for combination of unification algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-22102-7_24openalex-snapshot
Building and Combining Matching Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-98668-0_4openalex-snapshot
Raven: An SMT-Based Concurrency Verifier
inferred← citeshttps://doi.org/10.1007/978-3-319-13524-3_2openalex-snapshot
On the Parameterized Complexity of Associative and Commutative Unification
inferred← citeshttps://doi.org/10.1007/978-3-319-29510-7_1openalex-snapshot
Variant-Based Satisfiability in Initial Algebras
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-319-48758-8_4openalex-snapshot
Approximate Unification in the Description Logic $$\mathcal {FL}_0$$
inferred← citeshttps://doi.org/10.1007/978-3-540-30109-7_14openalex-snapshot
Generalization Algorithms for Second-Order Terms
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_30openalex-snapshot
Unification and Matching Modulo Leaf-Permutative Equational Presentations
inferred← citeshttps://doi.org/10.1007/978-3-540-74615-7_1openalex-snapshot
Foundations of Rule-Based Query Answering
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_8openalex-snapshot
SAT Encoding of Unification in $\mathcal{EL}$
inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_26openalex-snapshot
Type Inference for Sublinear Space Functional Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-38946-7_11openalex-snapshot
Intersection Type Matching with Subtyping
inferred← citeshttps://doi.org/10.1007/978-3-662-21551-7_23openalex-snapshot
Combination techniques and decision problems for disunification
inferred← citeshttps://doi.org/10.1007/bf00247671openalex-snapshot
Any ground associative-commutative theory has a finite canonical system
inferred← citeshttps://doi.org/10.1007/bf00881860openalex-snapshot
On the complexity of nested-object matching
inferred← citeshttps://doi.org/10.1007/bfb0017446openalex-snapshot
On the complexity of unification and disunification in commutative idempotent semigroups
inferred← citeshttps://doi.org/10.1007/s13218-020-00664-9openalex-snapshot
Quantitative Variants of Language Equations and their Applications to Description Logics
inferred← citeshttps://doi.org/10.1007/s41965-021-00076-0openalex-snapshot
An efficient labelled nested multiset unification algorithm
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00277-0openalex-snapshot
Combination techniques and decision problems for disunification
inferred← citeshttps://doi.org/10.1016/0898-1221(94)00218-aopenalex-snapshot
An overview of Rewrite Rule Laboratory (RRL)
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.07.004openalex-snapshot
A Formalisation of Nominal C-Matching through Unification with Protected Variables
inferred← citeshttps://doi.org/10.1016/j.jlamp.2026.101144openalex-snapshot
Fuzzy similarity and proximity constraint solving in theories with unordered symbols
inferred← citeshttps://doi.org/10.1016/j.scico.2017.09.001openalex-snapshot
Variant-based satisfiability in initial algebras
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/s0020-0190(99)00006-xopenalex-snapshot
Generating languages by a derivation procedure for elementary formal systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00122-4openalex-snapshot
Type dependencies for logic programs using ACI-unification
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00007-2openalex-snapshot
An algebraic approach to sharing analysis of logic programs
inferred← citeshttps://doi.org/10.1017/s0960129519000185openalex-snapshot
Extensions of unification modulo ACUI
inferred← citeshttps://doi.org/10.1017/s0960129521000050openalex-snapshot
Formalising nominal C-unification generalised with protected variables
inferred← citeshttps://doi.org/10.1109/ccc.1997.612304openalex-snapshot
Complexity and expressive power of logic programming
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.1109/lics.1993.287572openalex-snapshot
The unifiability problem in ground AC theories
inferred← citeshttps://doi.org/10.1109/lics.1993.287600openalex-snapshot
On the unification problem for Cartesian closed categories
inferred← citeshttps://doi.org/10.1109/lics.1996.561463openalex-snapshot
Solving linear equations over polynomial semirings
inferred← citeshttps://doi.org/10.1145/365151.365169openalex-snapshot
Sets and constraint logic programming
inferred← citeshttps://doi.org/10.1145/502807.502810openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.1145/982158.982161openalex-snapshot
Natural semantics as a static program analysis framework
inferred← citeshttps://doi.org/10.22028/d291-25942openalex-snapshot
Superposition and decision procedures back and forth
inferred← citeshttps://doi.org/10.2307/2275552openalex-snapshot
On the unification problem for Cartesian closed categories
inferred← citeshttps://doi.org/10.25368/2022.228openalex-snapshot
Approximate Unification in the Description Logic FL₀
inferred← citeshttps://doi.org/10.29007/mj4lopenalex-snapshot
Unication Problems Modulo a Theory of Until
inferred← citeshttps://doi.org/10.4018/978-1-60566-330-2openalex-snapshot
Services and Business Computing Solutions With Xml: Applications for Quality Management and Best Processes
inferred← citeshttps://doi.org/10.4204/eptcs.332openalex-snapshot
Proceedings Fifteenth Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
inferred← citeshttps://doi.org/10.4204/eptcs.332.2openalex-snapshot
Object-Level Reasoning with Logics Encoded in HOL Light
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.