On the public citation graph

Solving disequations in equational theories

https://doi.org/10.1007/bfb0012853
0 signed · 52 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.
Claim with ORCID
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.
See reference health

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-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_111openalex-snapshot
Combination of unification algorithms
inferredcites →https://doi.org/10.1007/3-540-16780-3_85openalex-snapshot
Sufficient completeness, term rewriting systems and ”anti-unification”
inferredcites →https://doi.org/10.1007/3-540-17220-3_18openalex-snapshot
On equational theories, unification and decidability
inferredcites →https://doi.org/10.1007/3-540-19129-1_4openalex-snapshot
Unification Revisited
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-0-387-77487-9openalex-snapshot
Universal Algebra
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/bf00243791openalex-snapshot
Unification in Abelian semigroups
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/bf00246024openalex-snapshot
Unification in datastructure multisets
inferredcites →https://doi.org/10.1007/bf00297251openalex-snapshot
Opening the AC-unification race
inferredcites →https://doi.org/10.1007/bf00381143openalex-snapshot
Link inheritance in abstract clause graphs
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)80017-3openalex-snapshot
Equational problems anddisunification
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
inferredcites →https://doi.org/10.2307/2322184openalex-snapshot
A Course in Universal Algebra.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11532231_30openalex-snapshot
Model Representation via Contexts and Implicit Generalizations
inferred← citeshttps://doi.org/10.1007/11799573_32openalex-snapshot
Solving First-Order Constraints in the Theory of the Evaluated Trees
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-54233-7_156openalex-snapshot
Complete axiomatizations of some quotient term algebras
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-61464-8_40openalex-snapshot
AC-complete unification and its application to theorem proving
inferred← citeshttps://doi.org/10.1007/978-3-540-73817-6_7openalex-snapshot
Solving First-Order Constraints in the Theory of the Evaluated Trees
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/bf00297251openalex-snapshot
Opening the AC-unification race
inferred← citeshttps://doi.org/10.1007/bf01189020openalex-snapshot
Narrowing based procedures for equational disunification
inferred← citeshttps://doi.org/10.1007/bfb0018439openalex-snapshot
Extending resolution for model construction
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(93)90108-6openalex-snapshot
Complete axiomatizations of some quotient term algebras
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00224-7openalex-snapshot
Incremental constraint satisfaction for equational logic programming
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/b978-044450813-3/50010-2openalex-snapshot
Unification Theory
inferred← citeshttps://doi.org/10.1016/s0747-7171(10)80014-8openalex-snapshot
A method for simultaneous search for refutations and models by equational constraint solving
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80017-3openalex-snapshot
Equational problems anddisunification
inferred← citeshttps://doi.org/10.1017/s1471068406002997openalex-snapshot
Decomposable theories
inferred← citeshttps://doi.org/10.1017/s1471068407003171openalex-snapshot
Theory of finite or infinite trees revisited
inferred← citeshttps://doi.org/10.1023/b:cons.0000006182.84033.6eopenalex-snapshot
Disunification in ACI1 Theories
inferred← citeshttps://doi.org/10.1093/logcom/exm008openalex-snapshot
Model Representation over Finite and Infinite Signatures
inferred← citeshttps://doi.org/10.1145/1141277.1141280openalex-snapshot
Solving first-order constraints in the theory of finite or infinite trees
inferred← citeshttps://doi.org/10.1145/1352582.1352583openalex-snapshot
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
inferred← citeshttps://doi.org/10.1145/179812.179813openalex-snapshot
On solving equations and disequations
inferred← citeshttps://doi.org/10.48550/arxiv.0706.4323openalex-snapshot
Theory of Finite or Infinite Trees Revisited
inferred← citeshttps://doi.org/10.5802/roia.75openalex-snapshot
Contraintes du premier ordre dans l’algèbre des arbres finis ou infinis
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.