On the public citation graph

A Generic Modular Data Structure for Proof Attempts Alternating on Ideas and Granularity

0 signed · 41 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/10721959openalex-snapshot
Automated deduction - CADE-17 : 17th International Conference on Automated Deduction, Pittsburgh, PA, USA, June 17-20, 2000 : proceedings
inferredcites →https://doi.org/10.1007/10721959_11openalex-snapshot
System Description: TPS: A Theorem Proving System for Type Theory
inferredcites →https://doi.org/10.1007/3-540-36078-6_25openalex-snapshot
Proof Development with ΩMEGA: √2 Is Irrational
inferredcites →https://doi.org/10.1007/3-540-44957-4_43openalex-snapshot
Proof Planning with Multiple Strategies
inferredcites →https://doi.org/10.1007/3-540-45620-1_12openalex-snapshot
Proof Development with Ωmega
inferredcites →https://doi.org/10.1007/3-540-45653-8_1openalex-snapshot
Monodic Fragments of First-Order Temporal Logics: 2000–2001 A.D.
inferredcites →https://doi.org/10.1007/3-540-58156-1openalex-snapshot
Automated Deduction — CADE-12
inferredcites →https://doi.org/10.1007/3-540-58156-1_53openalex-snapshot
Reconstructing proofs at the assertion level
inferredcites →https://doi.org/10.1007/3-540-61511-3openalex-snapshot
Automated Deduction — Cade-13
inferredcites →https://doi.org/10.1007/3-540-61511-3_92openalex-snapshot
INKA: The next generation
inferredcites →https://doi.org/10.1007/978-3-540-45085-6_22openalex-snapshot
IsaPlanner: A Prototype Proof Planner in Isabelle
inferredcites →https://doi.org/10.1007/978-3-540-45085-6_29openalex-snapshot
How to Prove Inductive Theorems? QuodLibet!
inferredcites →https://doi.org/10.1007/978-3-662-07964-5openalex-snapshot
Interactive Theorem Proving and Program Development
inferredcites →https://doi.org/10.1007/978-94-017-0253-9_11openalex-snapshot
Proof Development with Ωmega: The Irrationality of $$\sqrt 2$$
inferredcites →https://doi.org/10.1007/bfb0030541openalex-snapshot
Isabelle
inferredcites →https://doi.org/10.1007/s100099900022openalex-snapshot
VSE: formal methods meet industrial needs
inferredcites →https://doi.org/10.1016/j.artint.2007.11.004openalex-snapshot
Proof planning with multiple strategies
inferredcites →https://doi.org/10.1016/j.entcs.2004.02.021openalex-snapshot
Interactive Theorem Proving with Tasks
inferredcites →https://doi.org/10.1016/s0004-3702(99)00076-4openalex-snapshot
Knowledge-based proof planning
inferredcites →https://doi.org/10.1093/jigpal/12.1.1openalex-snapshot
Descente Infinie + Deduction
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11812289_7openalex-snapshot
A Formal Correspondence Between OMDoc with Alternative Proofs and the ${\overline{\lambda}\mu\tilde{\mu}}$ -Calculus
inferred← citeshttps://doi.org/10.1007/11812289_9openalex-snapshot
Synthesizing Proof Planning Methods and Ω-Ants Agents from Mathematical Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-540-85110-3_34openalex-snapshot
Authoring Verified Documents by Interactive Proof Construction and Verification in Text-Editors
inferred← citeshttps://doi.org/10.1007/978-3-540-89408-7_13openalex-snapshot
Resource-Bounded Modelling and Analysis of Human-Level Interactive Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-89408-7_17openalex-snapshot
ΩMEGA: Resource-Adaptive Processes in an Automated Reasoning System
inferred← citeshttps://doi.org/10.1007/978-3-642-02614-0_20openalex-snapshot
Formal Proof: Reconciling Correctness and Understanding
inferred← citeshttps://doi.org/10.1007/978-3-642-04617-9_37openalex-snapshot
Presenting Proofs with Adapted Granularity
inferred← citeshttps://doi.org/10.1007/s11787-012-0056-7openalex-snapshot
HERBRAND’s Fundamental Theorem in the Eyes of JEAN VAN HEIJENOORT
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.09.024openalex-snapshot
PlatΩ: A Mediator between Text-Editors and Proof Assistance Systems
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.12.035openalex-snapshot
, , and Non-Permutability of -Steps
inferred← citeshttps://doi.org/10.1145/3341525.3387409openalex-snapshot
Aiding an Introduction to Formal Reasoning Within a First-Year Logic Course for CS Majors Using a Mobile Self-Study App
inferred← citeshttps://doi.org/10.22028/d291-26394openalex-snapshot
Assertion level proof planning with compiled strategies
inferred← citeshttps://doi.org/10.29007/kwk9openalex-snapshot
Different Proofs are Good Proofs
inferred← citeshttps://doi.org/10.29007/s478openalex-snapshot
Can a system learn from interactive proofs?
inferred← citeshttps://doi.org/10.3233/978-1-60750-028-5-599openalex-snapshot
Granularity-Adaptive Proof Presentation
inferred← citeshttps://doi.org/10.4204/eptcs.79.1openalex-snapshot
Towards an Intelligent Tutor for Mathematical Proofs
inferred← citeshttps://doi.org/10.48550/arxiv.0903.0314openalex-snapshot
Granularity-Adaptive Proof Presentation
inferred← citeshttps://doi.org/10.48550/arxiv.1405.6317openalex-snapshot
Herbrand's Fundamental Theorem: The Historical Facts and their Streamlining
inferred← citeshttps://doi.org/10.5485/tmcs.2008.0183openalex-snapshot
Proof step analysis for proof tutoring - a learning approach to granularity
inferred← citeshttps://doi.org/10.5485/tmcs.2008.0184openalex-snapshot
Verification of human-level proof steps in mathematics education
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.