On the public citation graph

Acquiring recursive and iterative concepts with explanation-based learning

0 signed · 58 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/978-1-4613-2279-5_28openalex-snapshot
Purpose-Directed Analogy: A Summary of Current Research
inferredcites →https://doi.org/10.1007/978-1-4684-7053-6openalex-snapshot
Lectures in Abstract Algebra
inferredcites →https://doi.org/10.1007/978-3-030-71522-9_300068openalex-snapshot
Artificial Intelligence
inferredcites →https://doi.org/10.1007/bf00995500openalex-snapshot
A class of functions synthesized from a finite number of examples and a lisp program scheme
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(79)90002-xopenalex-snapshot
Programming by examples
inferredcites →https://doi.org/10.1016/0004-3702(85)90005-0openalex-snapshot
Machine learning: An artificial intelligence approach
inferredcites →https://doi.org/10.1016/0004-3702(85)90028-1openalex-snapshot
Ordering conjunctive queries
inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot
Depth-first iterative-deepening
inferredcites →https://doi.org/10.1016/0004-3702(86)90066-4openalex-snapshot
The use of aggregation in causal simulation
inferredcites →https://doi.org/10.1016/0004-3702(88)90013-6openalex-snapshot
Defining operationality for explanation-based learning
inferredcites →https://doi.org/10.1016/0004-3702(90)90036-yopenalex-snapshot
Learning in mathematically-based domains: Understanding and generalizing obstacle cancellations
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.1016/b978-1-4832-1446-7.50034-0openalex-snapshot
Explanation-Based Generalization: A Unifying View
inferredcites →https://doi.org/10.1016/c2013-0-11764-3openalex-snapshot
Extending Explanation-Based Learning by Generalizing the Structure of Explanations
inferredcites →https://doi.org/10.1109/tsmc.1978.4310035openalex-snapshot
The Inference of Regular LISP Programs from Examples
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.21236/ad0785031openalex-snapshot
Situations, Actions, and Causal Laws
inferredcites →https://doi.org/10.21236/ada239419openalex-snapshot
Mathematical Theory of Computation
inferredcites →https://doi.org/10.7551/mitpress/3314.003.0008openalex-snapshot
Quantitative Results Concerning the Utility of Explanation-Based Learning
inferredcites →https://doi.org/10.7916/d8c254fhopenalex-snapshot
Generalizing Logic Circuit Designs by Analyzing Proofs of Correctness

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-56004-1_10openalex-snapshot
Desiderata for generalization-to-N algorithms
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-55630-2_6openalex-snapshot
Learning Hierarchical Problem Networks for Knowledge-Based Planning
inferred← citeshttps://doi.org/10.1007/bf00114163openalex-snapshot
A Critical Look at Experimental Evaluations of EBL
inferred← citeshttps://doi.org/10.1007/bf00993983openalex-snapshot
Statistical Methods for Analyzing Speedup Learning Experiments
inferred← citeshttps://doi.org/10.1007/springerreference_179550openalex-snapshot
Trace-Based Programming
inferred← citeshttps://doi.org/10.1016/0004-3702(93)90035-aopenalex-snapshot
A structural theory of explanation-based learning
inferred← citeshttps://doi.org/10.1016/0004-3702(93)90059-kopenalex-snapshot
An apprentice-based approach to knowledge acquisition
inferred← citeshttps://doi.org/10.1016/0004-3702(93)90080-uopenalex-snapshot
Acquiring search-control knowledge via static analysis
inferred← citeshttps://doi.org/10.1016/0019-0578(92)90038-kopenalex-snapshot
Case-based learning: A new paradigm for automated knowledge acquisition
inferred← citeshttps://doi.org/10.1016/b978-0-08-051055-2.50018-3openalex-snapshot
ACQUIRING GENERAL ITERATIVE CONCEPTS BY REFORMULATING EXPLANATIONS OF OBSERVED EXAMPLES
inferred← citeshttps://doi.org/10.1016/b978-0-273-08817-2.50014-5openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/b978-1-55860-200-7.50111-2openalex-snapshot
Learning with Inscrutable Theories
inferred← citeshttps://doi.org/10.1016/b978-1-55860-247-2.50009-7openalex-snapshot
Learning by Incomplete Explanations of Failures in Recursive Domains
inferred← citeshttps://doi.org/10.1016/b978-1-55860-247-2.50022-xopenalex-snapshot
An Asymptotic Analysis of Speedup Learning
inferred← citeshttps://doi.org/10.1016/b978-1-55860-247-2.50039-5openalex-snapshot
Dynamic Optimization
inferred← citeshttps://doi.org/10.1016/b978-1-55860-247-2.50052-8openalex-snapshot
DYNAMIC: A new role for training problems in EBL
inferred← citeshttps://doi.org/10.1016/b978-1-55860-247-2.50060-7openalex-snapshot
Measuring Utility and the Design of Provably Good EBL Algorithms
inferred← citeshttps://doi.org/10.1016/b978-1-55860-377-6.50029-3openalex-snapshot
A Case Study of Explanation-Based Control
inferred← citeshttps://doi.org/10.1016/j.artint.2010.10.006openalex-snapshot
A new representation and associated algorithms for generalized planning
inferred← citeshttps://doi.org/10.1016/j.artint.2012.07.005openalex-snapshot
Applicability conditions for plans with loops: Computability results and algorithms
inferred← citeshttps://doi.org/10.1016/j.cogsys.2010.12.002openalex-snapshot
Inductive rule learning on the knowledge level
inferred← citeshttps://doi.org/10.1016/j.patrec.2017.06.003openalex-snapshot
Learning robot tasks with loops from experiences to enhance robot adaptability
inferred← citeshttps://doi.org/10.1016/s0004-3702(00)00025-4openalex-snapshot
Bounding the cost of learned rules
inferred← citeshttps://doi.org/10.1017/s026988891200001xopenalex-snapshot
A review of machine learning for automated planning
inferred← citeshttps://doi.org/10.1080/09540098908915640openalex-snapshot
An Approach to Combining Explanation-based and Neural Learning Algorithms
inferred← citeshttps://doi.org/10.1109/caia.1991.120876openalex-snapshot
Example-guided optimization of recursive domain theories
inferred← citeshttps://doi.org/10.1109/caia.1994.323697openalex-snapshot
An intelligent control shell for CAD tools
inferred← citeshttps://doi.org/10.1109/kbse.1993.341200openalex-snapshot
Validation of rule-based reactive systems by sound scenario generalization
inferred← citeshttps://doi.org/10.1109/kbse.1994.342676openalex-snapshot
Systematic incremental validation of rule-based reactive systems
inferred← citeshttps://doi.org/10.1111/j.1467-8640.2008.00330.xopenalex-snapshot
LEARNING TO SOLVE PROBLEMS FROM EXERCISES
inferred← citeshttps://doi.org/10.1609/icaps.v21i1.13475openalex-snapshot
Directed Search for Generalized Plans Using Classical Planners
inferred← citeshttps://doi.org/10.1613/jair.1.11227openalex-snapshot
Computing Hierarchical Finite State Controllers With Classical Planning
inferred← citeshttps://doi.org/10.20868/upm.thesis.1101openalex-snapshot
Programación genética de heurísticas para planificación
inferred← citeshttps://doi.org/10.2991/agi.2009.35openalex-snapshot
Analytical Inductive Programming as a Cognitive Rule Acquisition Devise
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.