On the public citation graph

Learning and applying generalised solutions using higher order resolution

https://doi.org/10.1007/bfb0012822
0 signed · 16 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-16492-8_94openalex-snapshot
Higher-order logic programming
inferredcites →https://doi.org/10.1007/978-3-662-12405-5_6openalex-snapshot
LEARNING BY EXPERIMENTATION: ACQUIRING AND REFINING PROBLEM-SOLVING HEURISTICS
inferredcites →https://doi.org/10.1016/0004-3702(72)90051-3openalex-snapshot
Learning and executing generalized robot plans
inferredcites →https://doi.org/10.1016/0743-1066(86)90015-4openalex-snapshot
Natural deduction as higher-order resolution
inferredcites →https://doi.org/10.1016/b978-0-934613-41-5.50041-6openalex-snapshot
Explanation-Based Generalization as Resolution Theorem Proving
inferredcites →https://doi.org/10.1023/a:1022691120807openalex-snapshot
Explanation-Based Generalization: A Unifying View

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-48686-0_43openalex-snapshot
Tractable and Intractable Second-Order Matching Problems
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_104openalex-snapshot
Higher-order unification with dependent function types
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_116openalex-snapshot
Programming by example and proving by example using higher-order unification
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_46openalex-snapshot
Decidable higher-order unification problems
inferred← citeshttps://doi.org/10.1007/3-540-63875-x_53openalex-snapshot
Proof discovery in LK system by analogy
inferred← citeshttps://doi.org/10.1007/bf00993253openalex-snapshot
Higher-order and modal logic as a framework for explanation-based generalization
inferred← citeshttps://doi.org/10.1007/bfb0013063openalex-snapshot
On the use of the constructive omega-rule within automated deduction
inferred← citeshttps://doi.org/10.1016/b978-1-55860-036-2.50113-2openalex-snapshot
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00096-xopenalex-snapshot
Proving theorems by reuse
inferred← citeshttps://doi.org/10.1023/a:1022676712939openalex-snapshot
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
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.