On the public citation graph
Reasoning about equality
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/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-81955-1_19openalex-snapshot
Paramodulation and Theorem-Proving in First-Order Theories with Equality
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1016/s0736-5853(86)80087-9openalex-snapshot
Automated Reasoning: Introduction and Applications
inferredcites →https://doi.org/10.1145/321420.321429openalex-snapshot
The Concept of Demodulation in Theorem Proving
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.0027openalex-snapshot
Strategy Compliant Multi-Threaded Term Completion
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-55602-8_208openalex-snapshot
Proving equality theorems with hyper-linking
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_74openalex-snapshot
On gaining efficiency in completion-based theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-61697-7_17openalex-snapshot
A master-slave approach to parallel term rewriting on a hierarchical multiprocessor
inferred← citeshttps://doi.org/10.1007/978-3-642-75100-4_11openalex-snapshot
Eqtheopogles A Completion Theorem Prover for PL1EQ
inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_9openalex-snapshot
Parallel Term Rewriting with Paredux
inferred← citeshttps://doi.org/10.1007/bf00243001openalex-snapshot
Solving open problems in right alternative rings with Z-module reasoning
inferred← citeshttps://doi.org/10.1007/bf00247439openalex-snapshot
Case studies of Z-module reasoning: Proving benchmark theorems from ring theory
inferred← citeshttps://doi.org/10.1007/bf00881872openalex-snapshot
Automated proofs of equality problems in Overbeek's competition
inferred← citeshttps://doi.org/10.1007/bf02186359openalex-snapshot
A selected artificial intelligence bibliography for operations researchers
inferred← citeshttps://doi.org/10.1007/bf02432151openalex-snapshot
Seventy-five problems for testing automatic theorem provers
inferred← citeshttps://doi.org/10.1016/s0167-739x(99)00088-6openalex-snapshot
Abstract machines for programming language implementation
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80020-xopenalex-snapshot
Automated proof of ring commutativity problems by algebraic methods
inferred← citeshttps://doi.org/10.1093/jigpal/jzaa013openalex-snapshot
Interactive proof-search for equational reasoning
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.