On the public citation graph
A rule-based algorithm for rigid E-unification
0 signed · 25 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/bfb0022569openalex-snapshot
A rule-based algorithm for rigid E-unification
inferredcites →https://doi.org/10.1016/0304-3975(79)90054-9openalex-snapshot
Tautology testing with a generalized matrix reduction method
inferredcites →https://doi.org/10.1016/b978-0-12-046371-8.50007-9openalex-snapshot
Completion Without Failure11This research was supported in part by the National Science Foundation under grants DCR 85–13417 and DCR 85–16243.
inferredcites →https://doi.org/10.1109/lics.1988.5121openalex-snapshot
Rigid E-unification is NP-complete
inferredcites →https://doi.org/10.1145/128749.128754openalex-snapshot
Theorem proving using equational matings and rigid E -unification
inferredcites →https://doi.org/10.1145/322186.322198openalex-snapshot
Fast Decision Procedures Based on Congruence Closure
inferredcites →https://doi.org/10.1145/322217.322228openalex-snapshot
Variations on the Common Subexpression Problem
inferredcites →https://doi.org/10.1145/322248.322249openalex-snapshot
Theorem Proving via General Matings
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-58216-9_34openalex-snapshot
Higher-order rigid E-unification
inferred← citeshttps://doi.org/10.1007/3-540-58467-6_28openalex-snapshot
Rigid unification by completion and rigid paramodulation
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_25openalex-snapshot
Rigid E-unification simplified
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_36openalex-snapshot
Specifications of inference rules and their automatic translation
inferred← citeshttps://doi.org/10.1007/3-540-61630-6_4openalex-snapshot
What you always wanted to know about rigid E-unification
inferred← citeshttps://doi.org/10.1007/978-3-662-54580-5_13openalex-snapshot
Congruence Closure with Free Variables
inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_7openalex-snapshot
Specifications of Inference Rules: Extensions of the PTTP Technique
inferred← citeshttps://doi.org/10.1007/bfb0021970openalex-snapshot
A complete connection calculus with rigid E-unification
inferred← citeshttps://doi.org/10.1007/s002000050001openalex-snapshot
Special Cases and Substitutes for Rigid E -Unification
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50012-6openalex-snapshot
Equality Reasoning in Sequent-Based Calculi
inferred← citeshttps://doi.org/10.1023/a:1005996623714openalex-snapshot
What You Always Wanted to Know about Rigid E-Unification
inferred← citeshttps://doi.org/10.1109/lics.1994.316041openalex-snapshot
Rigid E/spl I.oarr/-unifiability is DEXPTIME-complete
showing the first 14 of 15 · page through all 15
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.