On the public citation graph

Gazing: An approach to the problem of definition and lemma use

0 signed · 22 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-10009-1_21openalex-snapshot
Abstraction mappings in mechanical theorem proving
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_1openalex-snapshot
Universal Unification
inferredcites →https://doi.org/10.1007/bf00247438openalex-snapshot
The problem of definition expansion and contraction
inferredcites →https://doi.org/10.1016/0004-3702(71)90010-5openalex-snapshot
Strips: A new approach to the application of theorem proving to problem solving
inferredcites →https://doi.org/10.1016/0004-3702(72)90051-3openalex-snapshot
Learning and executing generalized robot plans
inferredcites →https://doi.org/10.1016/0004-3702(74)90026-5openalex-snapshot
Planning in a hierarchy of abstraction spaces
inferredcites →https://doi.org/10.1016/0004-3702(88)90030-6openalex-snapshot
Man-machine theorem proving in graph theory
inferredcites →https://doi.org/10.1080/00029890.1985.11971545openalex-snapshot
AUTOMATED REASONING
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.2307/2274625openalex-snapshot
Larry Wos. Automated reasoning: 33 basic research problems. Prentice Hall, Englewood Cliffs, N.J., 1988, xiii + 319 pp.

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-48660-7_31openalex-snapshot
Abstraction-Based Relevancy Testing for Model Elimination
inferred← citeshttps://doi.org/10.1007/3-540-61732-9_48openalex-snapshot
Analytica — An experiment in combining theorem proving and symbolic computation
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_13openalex-snapshot
Divvy: An ATP Meta-system Based on Axiom Relevance Ordering
inferred← citeshttps://doi.org/10.1007/978-3-642-14203-1_37openalex-snapshot
Premise Selection in the Naproche System
inferred← citeshttps://doi.org/10.1007/978-94-015-9558-2_12openalex-snapshot
The Growth of Mathematical Knowledge: An Open World View
inferred← citeshttps://doi.org/10.1007/bf00252180openalex-snapshot
TPS: A theorem-proving system for classical type theory
inferred← citeshttps://doi.org/10.1007/bfb0027424openalex-snapshot
A framework for using knowledge in tableau proofs
inferred← citeshttps://doi.org/10.1007/bfb0054272openalex-snapshot
Selectively instantiating definitions
inferred← citeshttps://doi.org/10.1007/s10817-015-9331-7openalex-snapshot
Definitional Expansions in Mizar
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.002openalex-snapshot
TPS: A hybrid automatic-interactive system for developing proofs
inferred← citeshttps://doi.org/10.1023/a:1006079212546openalex-snapshot
Analytica – An Experiment in Combining Theorem Proving and Symbolic Computation
inferred← citeshttps://doi.org/10.1023/a:1010639725972openalex-snapshot
Solving Open Questions and Other Challenge Problems Using Proof Sketches
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.