On the public citation graph

Generating relevant models

https://doi.org/10.1007/bf00249019
0 signed · 30 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-16780-3_100openalex-snapshot
What you always wanted to know about clause graph resolution
inferredcites →https://doi.org/10.1007/978-0-85729-198-1_6openalex-snapshot
Natural Language Processing
inferredcites →https://doi.org/10.1007/bf02432151openalex-snapshot
Seventy-five problems for testing automatic theorem provers
inferredcites →https://doi.org/10.1007/bfb0012847openalex-snapshot
SATCHMO: A theorem prover implemented in Prolog
inferredcites →https://doi.org/10.1145/321906.321919openalex-snapshot
A Proof Procedure Using Connection Graphs
inferredcites →https://doi.org/10.7551/mitpress/8263.003.0010openalex-snapshot
The Mind-System

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-45331-8_7openalex-snapshot
Theorem Proving for Constructive λ-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45683-x_6openalex-snapshot
R-UNSEARCHMO: A Refinement on UNSEARCHMO
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_70openalex-snapshot
Mixing metafor
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_22openalex-snapshot
Constructing a normal form for Property Theory
inferred← citeshttps://doi.org/10.1007/978-1-4471-3207-3_34openalex-snapshot
Formal Logic For Expert Systems
inferred← citeshttps://doi.org/10.1007/978-94-011-4231-1_3openalex-snapshot
Dynamic and Underspecified Interpretation without Dynamic or Underspecified Logic
inferred← citeshttps://doi.org/10.1007/bf00881857openalex-snapshot
Theorem proving for intensional logic
inferred← citeshttps://doi.org/10.1007/bf00881861openalex-snapshot
SATCHMORE: SATCHMO with RElevancy
inferred← citeshttps://doi.org/10.1007/bf00881955openalex-snapshot
Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction
inferred← citeshttps://doi.org/10.1007/bf02947117openalex-snapshot
Eliminating redundant search space on backtracking for forward chaining theorem proving
inferred← citeshttps://doi.org/10.1007/bf02948883openalex-snapshot
I-SATCHMORE: An improvement ofA-SATCHMORE
inferred← citeshttps://doi.org/10.1007/bf03037473openalex-snapshot
SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy
inferred← citeshttps://doi.org/10.1007/bfb0026833openalex-snapshot
Goal-directed query processing in disjunctive logic databases
inferred← citeshttps://doi.org/10.1007/bfb0027811openalex-snapshot
Constructing more relevant models
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00368-5openalex-snapshot
A relevance restriction strategy for automated deduction
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00076-xopenalex-snapshot
Computing abduction by using TMS with top-down expectation
inferred← citeshttps://doi.org/10.1023/a:1017594402123openalex-snapshot
I-SATCHMO: An Improvement of SATCHMO
inferred← citeshttps://doi.org/10.1023/a:1020109502432openalex-snapshot
Duality for Goal-Driven Query Processing in Disjunctive Deductive Databases
inferred← citeshttps://doi.org/10.1023/a:1020512924736openalex-snapshot
Ordered Semantic Hyper Tableaux
inferred← citeshttps://doi.org/10.1075/cilt.309.17fieopenalex-snapshot
Minimal sets of minimal speech acts
inferred← citeshttps://doi.org/10.1093/jigpal/9.1.83openalex-snapshot
Theorem proving for untyped constructive -calculus: implementation and application
inferred← citeshttps://doi.org/10.1093/logcom/exm073openalex-snapshot
Speech Acts, Epistemic Planning and Grice's Maxims
inferred← citeshttps://doi.org/10.1109/time.2002.1027484openalex-snapshot
Temporal views as abstract relations
inferred← citeshttps://doi.org/10.4995/thesis/10251/6023openalex-snapshot
Resolución SL*: Un paradigma basado en resolución lineal para la demostración automática
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.