On the public citation graph
The kernel strategy and its use for the study of combinatory logic
0 signed · 33 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.
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.
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_17openalex-snapshot
Hyperparamodulation: A refinement of paramodulation
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_19openalex-snapshot
Paramodulation and Theorem-Proving in First-Order Theories with Equality
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_33openalex-snapshot
Maximal Models and Refutation Completeness: Semidecision Procedures in Automatic Theorem Proving
inferredcites →https://doi.org/10.1007/bf00381147openalex-snapshot
A case study in automated theorem proving: Finding sages in combinatory logic
inferredcites →https://doi.org/10.1007/bf02328452openalex-snapshot
Set theory in first-order logic: Clauses for Gödel's axioms
inferredcites →https://doi.org/10.1016/0098-3004(76)90046-7openalex-snapshot
Computers and Mathematics with Applications
inferredcites →https://doi.org/10.1016/0304-3975(91)90034-yopenalex-snapshot
The absence and the presence of fixed point combinators
inferredcites →https://doi.org/10.1016/0898-1221(76)90002-xopenalex-snapshot
Complexity and related enhancements for automated theorem-proving programs
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/s0049-237x(08)71923-2openalex-snapshot
Maximal Models and Refutation Completeness: Semidecision Procedures in Automatic Theorem Proving
inferredcites →https://doi.org/10.1016/s0736-5853(86)80087-9openalex-snapshot
Automated Reasoning: Introduction and Applications
inferredcites →https://doi.org/10.1145/321296.321302openalex-snapshot
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
inferredcites →https://doi.org/10.1145/321420.321429openalex-snapshot
The Concept of Demodulation in Theorem Proving
inferredcites →https://doi.org/10.2172/6852789openalex-snapshot
Searching for fixed point combinators by using automated theorem proving: A preliminary report
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.1002/9780470996751.ch45openalex-snapshot
The Automation of Sound Reasoning and Successful Proof Finding
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_54openalex-snapshot
Problems on the generation of finite models
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_13openalex-snapshot
The Flowering of Automated Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-36675-8_1openalex-snapshot
The Legacy of a Great Researcher
inferred← citeshttps://doi.org/10.1007/bf00244497openalex-snapshot
OTTER and the Moufang identity problem
inferred← citeshttps://doi.org/10.1007/bf00247667openalex-snapshot
Constructing finite algebras with FALCON
inferred← citeshttps://doi.org/10.1007/bf00247668openalex-snapshot
The power of combining resonance with heat
inferred← citeshttps://doi.org/10.1007/bf00881715openalex-snapshot
OTTER experiments in a system of combinatory logic
inferred← citeshttps://doi.org/10.1007/bf02943488openalex-snapshot
Automatic construction of finite algebras
inferred← citeshttps://doi.org/10.1007/s10817-022-09620-8openalex-snapshot
Larry Wos: Visions of Automated Reasoning
inferred← citeshttps://doi.org/10.1023/a:1005843632307openalex-snapshot
Otter - The CADE-13 Competition Incarnations
inferred← citeshttps://doi.org/10.1023/a:1005878609884openalex-snapshot
A New Technique for Verifying and Correcting Logic Programs
inferred← citeshttps://doi.org/10.1145/372202.372206openalex-snapshot
Automatic symmetry breaking method combined with SAT
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.