On the public citation graph
Machine Discovery of Effective Admissible Heuristics
0 signed · 80 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.1002/9781119584445.ch10openalex-snapshot
The Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/978-1-4613-1703-6openalex-snapshot
Learning Search Control Knowledge
inferredcites →https://doi.org/10.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
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/978-3-662-12405-5_9openalex-snapshot
THE ROLE OF HEURISTICS IN LEARNING BY DISCOVERY: THREE CASE STUDIES
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(80)90026-0openalex-snapshot
Principles of artificial intelligence
inferredcites →https://doi.org/10.1016/0004-3702(82)90036-4openalex-snapshot
The nature of heuristics
inferredcites →https://doi.org/10.1016/0004-3702(84)90016-xopenalex-snapshot
Why am and eurisko appear to work
inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot
Depth-first iterative-deepening
inferredcites →https://doi.org/10.1016/0004-3702(90)90102-6openalex-snapshot
Learning problem solving strategies using refinement and macro generation
inferredcites →https://doi.org/10.1016/0020-0255(79)90024-0openalex-snapshot
A method for computing heuristics in problem solving
inferredcites →https://doi.org/10.1016/0020-0255(84)90009-4openalex-snapshot
A result on the computational complexity of heuristic estimates for the A∗ algorithm
inferredcites →https://doi.org/10.1016/0020-0255(92)90070-oopenalex-snapshot
Criticizing solutions to relaxed models yields powerful admissible heuristics
inferredcites →https://doi.org/10.1016/0022-2496(83)90037-8openalex-snapshot
Machine learning: An artificial intelligence approach
inferredcites →https://doi.org/10.1016/0306-4573(85)90100-1openalex-snapshot
Heuristics: Intelligent search strategies for computer problem solving.
inferredcites →https://doi.org/10.1016/b978-0-934613-03-3.50007-6openalex-snapshot
A PROBLEM SIMILARITY APPROACH TO DEVISING HEURISTICS: FIRST RESULTS
inferredcites →https://doi.org/10.1016/b978-1-55860-036-2.50068-0openalex-snapshot
Discovering Admissible Search Heuristics by Abstracting and Optimizing
inferredcites →https://doi.org/10.1016/s0004-3702(83)80004-6openalex-snapshot
Theory formation by heuristic search
inferredcites →https://doi.org/10.1016/s0019-9958(74)80007-0openalex-snapshot
Machine Intelligence. Vol. 7.
inferredcites →https://doi.org/10.1145/1056441.1056445openalex-snapshot
Review of "Principles of Artificial Intelligence by Nils J. Nilsson", Tioga Publishing Company, Palo Alto, CA, ISBN 0-935382-01-1.
inferredcites →https://doi.org/10.1145/2213977.2214038openalex-snapshot
The traveling salesman problem
inferredcites →https://doi.org/10.1145/322290.322291openalex-snapshot
Mechanical Discovery of Classes of Problem-Solving Strategies
inferredcites →https://doi.org/10.1145/357172.357177openalex-snapshot
Finite Differencing of Computable Expressions
inferredcites →https://doi.org/10.1147/rd.441.0206openalex-snapshot
Some studies in machine learning using the game of checkers
inferredcites →https://doi.org/10.1287/opre.18.6.1138openalex-snapshot
The Traveling-Salesman Problem and Minimum Spanning Trees
inferredcites →https://doi.org/10.7916/d8pv6tfwopenalex-snapshot
Approximate Theory Formation: An Explanation-Based Approach
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/scj.10254openalex-snapshot
Improving heuristic function of cost‐based abduction system using real‐time heuristic search
inferred← citeshttps://doi.org/10.1007/11527862_2openalex-snapshot
Generating Admissible Heuristics by Abstraction for Search in Stochastic Domains
inferred← citeshttps://doi.org/10.1007/3-540-44914-0_18openalex-snapshot
Experiments with Automatically Created Memory-Based Heuristics
inferred← citeshttps://doi.org/10.1007/3-540-45153-6_19openalex-snapshot
Searching for Nacro Operators with Automatically Generated Heuristics
inferred← citeshttps://doi.org/10.1007/3-540-45622-8_3openalex-snapshot
Spatiotemporal Abstraction of Stochastic Sequential Processes
inferred← citeshttps://doi.org/10.1007/978-3-030-30179-8_21openalex-snapshot
Simplifying Automated Pattern Selection for Planning with Symbolic Pattern Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-73580-9_41openalex-snapshot
Using Infeasibility to Improve Abstraction-Based Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-642-04617-9_8openalex-snapshot
Solving Non-deterministic Planning Problems with Pattern Database Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-642-39712-7_36openalex-snapshot
When Classification becomes a Problem: Using Branch-and-Bound to Improve Classification Efficiency
inferred← citeshttps://doi.org/10.1007/978-3-7091-2530-4_2openalex-snapshot
Sequential Decision Making in Heuristic Search
inferred← citeshttps://doi.org/10.1007/bf00974979openalex-snapshot
Heuristic evaluation functions in artificial intelligence search algorithms
inferred← citeshttps://doi.org/10.1007/bf01543476openalex-snapshot
The mathematical modeling of heuristics
inferred← citeshttps://doi.org/10.1007/s10472-014-9432-8openalex-snapshot
Predicting optimal solution cost with conditional probabilities
inferred← citeshttps://doi.org/10.1016/0004-3702(94)00084-eopenalex-snapshot
Quantitatively relating abstractness to the accuracy of admissible heuristics
inferred← citeshttps://doi.org/10.1016/0957-4174(96)00013-9openalex-snapshot
Analogy by abstraction: Case retrieval and adaptation for inventive design expert systems
inferred← citeshttps://doi.org/10.1016/b978-1-55860-307-3.50020-4openalex-snapshot
Synthesis of Abstraction Hierarchies for Constraint Satisfaction by Clustering Approximately Equivalent Objects
inferred← citeshttps://doi.org/10.1016/b978-1-55860-335-6.50014-3openalex-snapshot
The Generate, Test, and Explain Discovery System Architecture
inferred← citeshttps://doi.org/10.1016/c2009-0-27773-7openalex-snapshot
Artificial Intelligence: A New Synthesis
inferred← citeshttps://doi.org/10.1016/j.artint.2004.07.001openalex-snapshot
Introduction to the Special Volume on Reformulation
inferred← citeshttps://doi.org/10.1016/j.artint.2010.04.021openalex-snapshot
Optimal admissible composition of abstraction heuristics
inferred← citeshttps://doi.org/10.1016/j.artint.2010.06.002openalex-snapshot
The computational complexity of avoiding spurious states in state space abstraction
inferred← citeshttps://doi.org/10.1016/j.artint.2011.08.001openalex-snapshot
Learning heuristic functions for large state spaces
inferred← citeshttps://doi.org/10.1016/j.artint.2015.09.012openalex-snapshot
Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00107-2openalex-snapshot
A general scheme for automatic generation of search heuristics from specification dependencies☆☆Preliminary versions of this paper were presented in [15,16,18]. This work was supported in part by NSF grant IIS-0086529 and by MURI ONR award N00014-00-1-0617.
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00108-4openalex-snapshot
Planning as heuristic search
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00083-0openalex-snapshot
Pragmatic navigation: reactivity, heuristics, and search
inferred← citeshttps://doi.org/10.1016/s0950-7051(96)01049-0openalex-snapshot
Making AI systems more creative: the IPC-model
inferred← citeshttps://doi.org/10.1080/095281397147248openalex-snapshot
Adding upper-bound pruning to IDA*
inferred← citeshttps://doi.org/10.1098/rstb.2003.1317openalex-snapshot
Abstraction and reformulation in artificial intelligence
inferred← citeshttps://doi.org/10.1109/3468.686716openalex-snapshot
Learning while solving problems in best first search
inferred← citeshttps://doi.org/10.1109/69.634752openalex-snapshot
SHAPES: A novel approach for learning search heuristics in under-constrained optimization problems
inferred← citeshttps://doi.org/10.1109/cec.2017.7969355openalex-snapshot
Harmonic analysis and resynthesis of Sliding-Tile Puzzle heuristics
inferred← citeshttps://doi.org/10.1109/icra.2011.5980552openalex-snapshot
Efficient dynamic programming for high-dimensional, optimal motion planning by spectral learning of approximate value function symmetries
inferred← citeshttps://doi.org/10.1109/tsmca.1998.686717openalex-snapshot
Corrigendum To "The Design Process: Properties, Paradigms, And Structure"
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7563openalex-snapshot
Searching Without a Heuristic: Efficient Use of Abstraction
inferred← citeshttps://doi.org/10.1609/icaps.v21i1.13480openalex-snapshot
Abstraction Heuristics Extended with Counting Abstractions
inferred← citeshttps://doi.org/10.1609/socs.v3i1.18232openalex-snapshot
Automatic Move Pruning Revisited
inferred← citeshttps://doi.org/10.1613/jair.2486openalex-snapshot
A General Theory of Additive State Space Abstractions
inferred← citeshttps://doi.org/10.2118/195640-msopenalex-snapshot
Efficient Optimization of Well Drilling Sequence with Learned Heuristics
inferred← citeshttps://doi.org/10.2118/195640-paopenalex-snapshot
Efficient Optimization of Well-Drilling Sequence with Learned Heuristics
inferred← citeshttps://doi.org/10.3233/aic-140605openalex-snapshot
Automatic move pruning for single-agent search
inferred← citeshttps://doi.org/10.7282/t3-9ek0-2s77openalex-snapshot
Abstraction via approximate symmetry
inferred← citeshttps://doi.org/10.7939/r3543xopenalex-snapshot
Downward Path Preserving State Space Abstractions
inferred← citeshttps://doi.org/10.7939/r3668topenalex-snapshot
Cluster-and-Conquer: a Paradigm for Solving State-Space Problems
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.