On the public citation graph

Automatic Theorem-Proving.

0 signed · 12 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 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-54507-7_15openalex-snapshot
Automated deduction with associative commutative operators
inferred← citeshttps://doi.org/10.1007/978-0-387-34768-4_23openalex-snapshot
Analytic and Non-analytic Proofs
inferred← citeshttps://doi.org/10.1007/978-3-030-24886-4_21openalex-snapshot
Computing the k-binomial Complexity of the Thue–Morse Word
inferred← citeshttps://doi.org/10.1007/978-3-642-04843-2_41openalex-snapshot
The Convergence Control to the ACO Metaheuristic Using Annotated Paraconsistent Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-14128-7_35openalex-snapshot
Evidence Algorithm and System for Automated Deduction: A Retrospective View
inferred← citeshttps://doi.org/10.1007/978-3-642-66635-3_5openalex-snapshot
Logische Grundlagen des maschinellen Beweisens (Resolventenprinzip)
inferred← citeshttps://doi.org/10.1007/bf01270929openalex-snapshot
Automated deduction with associative-commutative operators
inferred← citeshttps://doi.org/10.1007/bfb0035637openalex-snapshot
Error tolerance method in multiple-valued logic
inferred← citeshttps://doi.org/10.1109/sccc.2000.890396openalex-snapshot
A paraconsistent system of autonomous agents for Brazilian bank check treatment
inferred← citeshttps://doi.org/10.1145/1109118.1109120openalex-snapshot
XFM
inferred← citeshttps://doi.org/10.46298/lmcs-20(3:12)2024openalex-snapshot
Decidability for Sturmian words
inferred← citeshttps://doi.org/10.5555/1894483.1894521openalex-snapshot
Evidence algorithm and system for automated deduction: a retrospective view
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.