On the public citation graph

Sequent Calculus Proof Search with Reinforcement Learning

0 signed · 7 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.1016/j.scico.2017.05.011openalex-snapshot
Inferring linear invariants with parallelotopes
inferredcites →https://doi.org/10.1038/nature24270openalex-snapshot
Mastering the game of Go without human knowledge
inferredcites →https://doi.org/10.1109/78.650093openalex-snapshot
Bidirectional recurrent neural networks
inferredcites →https://doi.org/10.1109/cog51982.2022.9893635openalex-snapshot
Combining Monte-Carlo Tree Search with Proof-Number Search
inferredcites →https://doi.org/10.1145/3560469openalex-snapshot
The Silent (R)evolution of SAT
inferredcites →https://doi.org/10.1162/neco.1997.9.8.1735openalex-snapshot
Long Short-Term Memory
inferredcites →https://doi.org/10.1609/aaai.v35i7.16780openalex-snapshot
A Deep Reinforcement Learning Approach to First-Order Logic Theorem Proving
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.