On the public citation graph

SPIKE, an automatic theorem prover

https://doi.org/10.1007/bfb0013087
0 signed · 34 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-19242-5_12openalex-snapshot
On word problems in Horn theories
inferredcites →https://doi.org/10.1007/3-540-53162-9_44openalex-snapshot
Implementation of completion by transition rules + control: ORME
inferredcites →https://doi.org/10.1007/bf02432151openalex-snapshot
Seventy-five problems for testing automatic theorem provers
inferredcites →https://doi.org/10.1093/logcom/5.5.631openalex-snapshot
Automated Mathematical Induction
inferredcites →https://doi.org/10.1145/116825.116833openalex-snapshot
Proving refutational completeness of theorem-proving strategies

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.2859openalex-snapshot
On Terminating Lemma Speculations
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_6openalex-snapshot
A Survey of Automated Deduction
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_43openalex-snapshot
Termination of constructor systems
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_72openalex-snapshot
Termination of theorem proving by reuse
inferred← citeshttps://doi.org/10.1007/978-0-85729-018-2_2openalex-snapshot
An Overview of Formal Methods Tools and Techniques
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_30openalex-snapshot
Automating Induction for Solving Horn Clauses
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_26openalex-snapshot
Proof Search and Proof Check for Equational and Inductive Theorems
inferred← citeshttps://doi.org/10.1007/978-3-540-73445-1_4openalex-snapshot
Towards Systematic Analysis of Theorem Provers Search Spaces: First Steps
inferred← citeshttps://doi.org/10.1007/978-3-540-75492-3_7openalex-snapshot
Analysis of Composite Web Services Using Logging Facilities
inferred← citeshttps://doi.org/10.1007/978-3-642-02716-1_4openalex-snapshot
A Schemata Calculus for Propositional Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-14203-1_32openalex-snapshot
Perfect Discrimination Graphs: Indexing Terms with Integer Exponents
inferred← citeshttps://doi.org/10.1007/978-3-642-31374-5_21openalex-snapshot
Reasoning on Schemata of Formulæ
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_9openalex-snapshot
Narrowing Based Inductive Proof Search
inferred← citeshttps://doi.org/10.1007/978-3-642-38574-2_4openalex-snapshot
Completeness and Decidability Results for First-Order Clauses with Indices
inferred← citeshttps://doi.org/10.1007/978-3-642-40885-4_2openalex-snapshot
Combining Superposition and Induction: A Practical Realization
inferred← citeshttps://doi.org/10.1007/bf00881856openalex-snapshot
Implicit induction in conditional theories
inferred← citeshttps://doi.org/10.1007/s10472-009-9154-5openalex-snapshot
Inductive proof search modulo
inferred← citeshttps://doi.org/10.1007/s10817-019-09519-xopenalex-snapshot
Combining Induction and Saturation-Based Theorem Proving
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50006-xopenalex-snapshot
Equational Logic and Rewriting
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.006openalex-snapshot
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.07.014openalex-snapshot
Mechanically certifying formula-based Noetherian induction reasoning
inferred← citeshttps://doi.org/10.1016/j.scico.2004.10.001openalex-snapshot
Rewriting of imperative programs into logical equations
inferred← citeshttps://doi.org/10.1016/j.scico.2017.10.012openalex-snapshot
Rewriting induction for constrained inequalities
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00096-xopenalex-snapshot
Proving theorems by reuse
inferred← citeshttps://doi.org/10.1109/synasc51798.2020.00025openalex-snapshot
SPIKE, an automatic theorem prover — revisited
inferred← citeshttps://doi.org/10.1145/3519939.3523731openalex-snapshot
CycleQ: an efficient basis for cyclic equational reasoning
inferred← citeshttps://doi.org/10.1613/jair.3351openalex-snapshot
Decidability and Undecidability Results for Propositional Schemata
inferred← citeshttps://doi.org/10.22028/d291-25997openalex-snapshot
Saturation-based decision procedures for fixed domain and minimal model validity
inferred← citeshttps://doi.org/10.29007/nsx4openalex-snapshot
A Unified View of Induction Reasoning for First-Order Logic
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.