On the public citation graph

Two loop detection mechanisms: A comparison

https://doi.org/10.1007/bfb0027414
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.
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-54487-9_58openalex-snapshot
Algorithmic proof with diminishing resources part 1
inferredcites →https://doi.org/10.1007/3-540-55602-8_189openalex-snapshot
Proof search in the intuitionistic sequent calculus
inferredcites →https://doi.org/10.1007/3-540-59338-1_44openalex-snapshot
Propositional logics on the computer
inferredcites →https://doi.org/10.1007/3-540-61208-4_14openalex-snapshot
Efficient loop-check for backward proof search in some non-classical propositional logics
inferredcites →https://doi.org/10.1007/3-540-61511-3_65openalex-snapshot
A resolution theorem prover for intuitionistic logic
inferredcites →https://doi.org/10.1007/bfb0022247openalex-snapshot
A λ-calculus structure isomorphic to Gentzen-style sequent calculus structure
inferredcites →https://doi.org/10.1017/s0960129500001328openalex-snapshot
A new constructive logic: classic logic
inferredcites →https://doi.org/10.1093/logcom/2.5.619openalex-snapshot
An Intuitionistic Predicate Logic Theorem Prover
inferredcites →https://doi.org/10.2307/2275431openalex-snapshot
Contraction-free sequent calculi for intuitionistic logic

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11532231_5openalex-snapshot
Tabling for Higher-Order Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_19openalex-snapshot
A History-Based Theorem Prover for Intuitionistic Propositional Logic Using Global Caching: IntHistGC System Description
inferred← citeshttps://doi.org/10.1007/978-3-319-29198-7_6openalex-snapshot
Intuitionistic Decision Procedures Since Gentzen
inferred← citeshttps://doi.org/10.1007/978-3-642-40537-2_11openalex-snapshot
A Terminating Evaluation-Driven Variant of G3i
inferred← citeshttps://doi.org/10.1007/s10817-012-9252-7openalex-snapshot
Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-Models
inferred← citeshttps://doi.org/10.1007/s10817-017-9427-3openalex-snapshot
Goal-Oriented Proof-Search in Natural Deduction for Intuitionistic Propositional Logic
inferred← citeshttps://doi.org/10.1007/s11225-019-09869-yopenalex-snapshot
Proof Theory for Positive Logic with Weak Negation
inferred← citeshttps://doi.org/10.1016/j.apal.2021.103026openalex-snapshot
A coinductive approach to proof search through typed lambda-calculi
inferred← citeshttps://doi.org/10.1016/j.entcs.2016.09.014openalex-snapshot
A Unified Procedure for Provability and Counter-Model Generation in Minimal Implicational Logic
inferred← citeshttps://doi.org/10.1017/s0960129501003334openalex-snapshot
Proof search in Lax Logic
inferred← citeshttps://doi.org/10.1145/2660770openalex-snapshot
An Evaluation-Driven Decision Procedure for G3i
inferred← citeshttps://doi.org/10.1145/3372299openalex-snapshot
Duality between Unprovability and Provability in Forward Refutation-search for Intuitionistic Propositional Logic
inferred← citeshttps://doi.org/10.30819/5141openalex-snapshot
Collaborative Technologies and Data Science in Artificial Intelligence Applications
inferred← citeshttps://doi.org/10.3233/fi-2018-1700openalex-snapshot
Multi-Agent Dialogues and Dialogue Sequents for Proof Search and Scheduling in Intuitionistic Logic and the Modal Logic S4
inferred← citeshttps://doi.org/10.3897/jucs.76563openalex-snapshot
On Recurrent Neural Network Based Theorem Prover For First Order Minimal Logic
inferred← citeshttps://doi.org/10.4204/eptcs.226.20openalex-snapshot
A New Rule for LTL Tableaux
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.