On the public citation graph
A Critical Look at Experimental Evaluations of EBL
0 signed · 47 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/978-1-4613-1691-6openalex-snapshot
Machine Learning of Robot Assembly Plans
inferredcites →https://doi.org/10.1007/978-1-4613-1703-6openalex-snapshot
Learning Search Control Knowledge
inferredcites →https://doi.org/10.1007/978-3-642-81952-0_4openalex-snapshot
Empirical Explorations with the Logic Theory Machine: A Case Study in Heuristics
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.1007/bf00114116openalex-snapshot
Explanation-Based Learning: An Alternative View
inferredcites →https://doi.org/10.1007/bf00115894openalex-snapshot
Acquiring recursive and iterative concepts with explanation-based learning
inferredcites →https://doi.org/10.1007/bf00116250openalex-snapshot
Explanation-based generalization: A unifying view
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)90035-4openalex-snapshot
Depth-first iterative-deepening: An optimal admissible tree search
inferredcites →https://doi.org/10.1016/0004-3702(90)90059-9openalex-snapshot
Quantitative results concerning the utility of explanation-based learning
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50016-6openalex-snapshot
Performance Evaluation of Data Intensive Logic Programs
inferredcites →https://doi.org/10.1016/b978-0-934613-41-5.50019-2openalex-snapshot
LT Revisited: Experimental Results of Applying Explanation-Based Learning to the Logic of Principia Mathematica
inferredcites →https://doi.org/10.1016/b978-0-934613-64-4.50051-7openalex-snapshot
Some Chunks Are Expensive
inferredcites →https://doi.org/10.1016/b978-0-934613-64-4.50052-9openalex-snapshot
The Role of Forgetting in Learning
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.1023/a:1022647915955openalex-snapshot
LT Revisited: Explanation-Based Learning and the Logic of Principia Mathematica
inferredcites →https://doi.org/10.1023/a:1022659708512openalex-snapshot
Acquiring Recursive and Iterative Concepts with Explanation-Based Learning
inferredcites →https://doi.org/10.1023/a:1022691120807openalex-snapshot
Explanation-Based Generalization: A Unifying View
inferredcites →https://doi.org/10.5555/92571.92623openalex-snapshot
On the sample complexity of pac-learning using random and chosen examples
inferredcites →https://doi.org/10.7916/d8hq46x1openalex-snapshot
Depth-First Iterative Deepening: An Optimal Admissible Tree Search
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf00881901openalex-snapshot
Bounded-overhead caching for definite-clause theorem proving
inferred← citeshttps://doi.org/10.1007/bf00993983openalex-snapshot
Statistical Methods for Analyzing Speedup Learning Experiments
inferred← citeshttps://doi.org/10.1007/bf01000409openalex-snapshot
On-Line Learning from Search Failures
inferred← citeshttps://doi.org/10.1007/s10472-010-9191-0openalex-snapshot
Tradeoffs in the empirical evaluation of competing algorithm designs
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)90092-popenalex-snapshot
Building large knowledge-based systems: Representation and inference in the cyc project
inferred← citeshttps://doi.org/10.1016/0004-3702(94)90011-6openalex-snapshot
A unified framework for explanation-based generalization of partially ordered and partially instantiated plans
inferred← citeshttps://doi.org/10.1016/0004-3702(94)90069-8openalex-snapshot
Automatically generating abstractions for planning
inferred← citeshttps://doi.org/10.1016/0004-3702(94)90077-9openalex-snapshot
A high-performance explanation-based learning algorithm
inferred← citeshttps://doi.org/10.1016/0004-3702(95)00039-hopenalex-snapshot
Artificial intelligence: an empirical science
inferred← citeshttps://doi.org/10.1016/0004-3702(95)00115-8openalex-snapshot
Exploratory analysis of speedup learning data using expectation maximization
inferred← citeshttps://doi.org/10.1016/b978-1-4832-0773-5.50016-xopenalex-snapshot
Concept Formation over Problem-Solving Experience
inferred← citeshttps://doi.org/10.1016/b978-1-4832-0774-2.50010-xopenalex-snapshot
Planning, Acting, and Learning in a Dynamic Domain
inferred← citeshttps://doi.org/10.1016/b978-1-55860-247-2.50057-7openalex-snapshot
On Combining Multiple Speedup Techniques
inferred← citeshttps://doi.org/10.1016/j.cor.2007.08.001openalex-snapshot
An optimal multiprocessor combinatorial auction solver
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00228-xopenalex-snapshot
Nagging: A scalable fault-tolerant paradigm for distributed search
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00246-1openalex-snapshot
Using genetic programming to learn and improve control knowledge
inferred← citeshttps://doi.org/10.1017/s0890060400001013openalex-snapshot
Annotated bibliography on research methodologies
inferred← citeshttps://doi.org/10.1145/1993053.1993058openalex-snapshot
Building Mashups by Demonstration
inferred← citeshttps://doi.org/10.1162/153244304773936081openalex-snapshot
10.1162/153244304773936081
inferred← citeshttps://doi.org/10.1613/jair.177openalex-snapshot
Adaptive Problem-solving for Large-scale Scheduling Problems: A Case Study
inferred← citeshttps://doi.org/10.1613/jair.484openalex-snapshot
A Selective Macro-learning Algorithm and its Application to the NxN Sliding-Tile Puzzle
inferred← citeshttps://doi.org/10.21236/ada269772openalex-snapshot
Automatically Generating Abstractions for Planning
inferred← citeshttps://doi.org/10.5281/zenodo.209820openalex-snapshot
FIGURE 4. Gnathia micheli n in First records of peracarid crustaceans from the Cayo Matias Ocean Blue Hole, SW Cuba, with the description of two new species
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.