On the public citation graph

Induction of recursive program schemes

https://doi.org/10.1007/bfb0026692
0 signed · 34 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-06953-4openalex-snapshot
Simple Program Schemes and Formal Languages
inferredcites →https://doi.org/10.1007/3-540-06953-4_1openalex-snapshot
Simple program schemes and formal languages
inferredcites →https://doi.org/10.1007/3-540-08921-7_53openalex-snapshot
The algebraic semantics of recursive program schemes
inferredcites →https://doi.org/10.1007/3-540-56004-1_10openalex-snapshot
Desiderata for generalization-to-N algorithms
inferredcites →https://doi.org/10.1007/3-540-57868-4_58openalex-snapshot
BMWk revisited generalization and formalization of an algorithm for detecting recursive relations in term sequences
inferredcites →https://doi.org/10.1007/3-540-63494-0openalex-snapshot
Inductive Logic Programming: 6th International Workshop, ILP-96, Stockholm, Sweden, August 26-28, 1996, Selected Papers
inferredcites →https://doi.org/10.1007/3-540-63494-0_65openalex-snapshot
Learning from positive data
inferredcites →https://doi.org/10.1007/bf00247434openalex-snapshot
How to clear a block: A theory of plans
inferredcites →https://doi.org/10.1016/0378-4754(86)90058-3openalex-snapshot
Artificial intelligence (methodology, systems, applications)
inferredcites →https://doi.org/10.1016/s0743-1066(99)00028-xopenalex-snapshot
Inductive synthesis of recursive logic programs: achievements and prospects
inferredcites →https://doi.org/10.1037//0278-7393.14.3.510openalex-snapshot
Analogical transfer, problem similarity, and expertise.
inferredcites →https://doi.org/10.1037//0278-7393.17.3.398openalex-snapshot
Mathematical problem solving by analogy.
inferredcites →https://doi.org/10.1080/09528139508953801openalex-snapshot
Integrating planning and learning: the PRODIGY architecture
inferredcites →https://doi.org/10.1109/tpami.1979.6786615openalex-snapshot
A Tree-to-Tree Distance and Its Application to Cluster Analysis
inferredcites →https://doi.org/10.1145/321992.322002openalex-snapshot
A Methodology for LISP Program Construction from Examples
inferredcites →https://doi.org/10.1184/r1/6616871openalex-snapshot
Knowledge Compilation: The General Learning Mechanism
inferredcites →https://doi.org/10.1609/aimag.v10i4.964openalex-snapshot
Universal planning: an (almost) universally bad idea

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-45751-8_10openalex-snapshot
Integrating Function Application in State-Based Planning
inferred← citeshttps://doi.org/10.1007/978-0-387-30164-8_838openalex-snapshot
Trace-Based Programming
inferred← citeshttps://doi.org/10.1007/978-1-4899-7502-7_844-1openalex-snapshot
Trace-Based Programming
inferred← citeshttps://doi.org/10.1007/978-1-4899-7502-7_844-2openalex-snapshot
Trace-Based Programming
inferred← citeshttps://doi.org/10.1007/978-1-4899-7687-1_844openalex-snapshot
Trace-Based Programming
inferred← citeshttps://doi.org/10.1007/978-3-031-45784-5_9openalex-snapshot
Predicate Anti-unification in (Constraint) Logic Programming
inferred← citeshttps://doi.org/10.1007/s10462-009-9108-7openalex-snapshot
An introduction to inductive programming
inferred← citeshttps://doi.org/10.1007/springerreference_179550openalex-snapshot
Trace-Based Programming
inferred← citeshttps://doi.org/10.1016/j.learninstruc.2006.11.002openalex-snapshot
How do we learn in a negative mood? Effects of a negative mood on transfer and learning
inferred← citeshttps://doi.org/10.1023/a:1008320413168openalex-snapshot
Comparing Structures Using a Hopfield-Style Neural Network
inferred← citeshttps://doi.org/10.1024/1421-0185.66.1.51openalex-snapshot
Effects of Mood and Problem Solving in Dyads on Transfer
inferred← citeshttps://doi.org/10.1145/2736282openalex-snapshot
Inductive programming meets the real world
inferred← citeshttps://doi.org/10.21236/ada363524openalex-snapshot
Iterative Macro-Operators Revisited: Applying Program Synthesis to Learning in Planning
inferred← citeshttps://doi.org/10.21236/ada382307openalex-snapshot
Applying Inductive Program Synthesis to Learning Domain-Dependent Control Knowledge - Transforming Plans into Programs
inferred← citeshttps://doi.org/10.4018/978-1-4666-3682-8.ch013openalex-snapshot
From Streams of Observations to Knowledge-Level Productive Predictions
inferred← citeshttps://doi.org/10.4324/9781410603494-115openalex-snapshot
Analogical Transfer of Non-Isomorphic Source Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1606.00075openalex-snapshot
Applications of Probabilistic Programming (Master's thesis, 2015)
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.