On the public citation graph
A General Theory of Additive State Space Abstractions
0 signed · 88 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/11527862_18openalex-snapshot
Solving the 24 Puzzle with Instance Dependent Pattern Databases
inferredcites →https://doi.org/10.1007/11527862_9openalex-snapshot
Hierarchical Heuristic Search Revisited
inferredcites →https://doi.org/10.1007/3-540-44914-0_18openalex-snapshot
Experiments with Automatically Created Memory-Based Heuristics
inferredcites →https://doi.org/10.1007/3-540-61291-2_68openalex-snapshot
Searching with pattern databases
inferredcites →https://doi.org/10.1007/978-3-642-17022-5_46openalex-snapshot
Solving the Sequential Ordering Problem with Automatically Generated Lower Bounds
inferredcites →https://doi.org/10.1007/bf00993063openalex-snapshot
Machine Discovery of Effective Admissible Heuristics
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/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/b978-0-934613-03-3.50007-6openalex-snapshot
A PROBLEM SIMILARITY APPROACH TO DEVISING HEURISTICS: FIRST RESULTS
inferredcites →https://doi.org/10.1016/j.artint.2006.09.002openalex-snapshot
Maximizing over multiple pattern databases speeds up heuristic search
inferredcites →https://doi.org/10.1016/s0004-3702(01)00092-3openalex-snapshot
Disjoint pattern database heuristics
inferredcites →https://doi.org/10.1016/s0166-218x(96)00069-8openalex-snapshot
Sorting with fixed-length reversals
inferredcites →https://doi.org/10.1093/acprof:oso/9780198528173.001.0001openalex-snapshot
Graphs and Homomorphisms
inferredcites →https://doi.org/10.1613/jair.1480openalex-snapshot
Additive Pattern Database Heuristics
inferredcites →https://doi.org/10.21236/ada127901openalex-snapshot
A Result on the Computational Complexity of Heuristic Estimates for the A Algorithm.
inferredcites →https://doi.org/10.7916/d8hq46x1openalex-snapshot
Depth-First Iterative Deepening: An Optimal Admissible Tree Search
inferredcites →https://doi.org/10.7939/r3fj29g5kopenalex-snapshot
Steps Towards The Automatic Creation of Search Heuristics
inferredcites →https://doi.org/10.7939/r3q52fg8copenalex-snapshot
A General Additive Search Abstraction
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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-642-21434-9_11openalex-snapshot
Learning Feature-Based Heuristic Functions
inferred← citeshttps://doi.org/10.1007/s10472-014-9432-8openalex-snapshot
Predicting optimal solution cost with conditional probabilities
inferred← citeshttps://doi.org/10.1007/s10472-014-9439-1openalex-snapshot
Heuristics as Markov chains
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.2011.02.001openalex-snapshot
Inconsistent heuristics in theory and practice
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.2012.05.003openalex-snapshot
Landmark-enhanced abstraction heuristics
inferred← citeshttps://doi.org/10.1016/j.artint.2015.05.011openalex-snapshot
Optimal Sokoban solving using pattern databases with specific domain knowledge
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/j.artint.2020.103405openalex-snapshot
Dynamically improved bounds bidirectional search
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103608openalex-snapshot
A framework for analysing state-abstraction methods
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7563openalex-snapshot
Searching Without a Heuristic: Efficient Use of Abstraction
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7766openalex-snapshot
Representation Discovery in Sequential Decision Making
inferred← citeshttps://doi.org/10.1609/aaai.v25i1.7829openalex-snapshot
Optimal Graph Search with Iterated Graph Cuts
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8137openalex-snapshot
Partial-Expansion A* with Selective Node Generation
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9374openalex-snapshot
Limitations of Front-To-End Bidirectional Heuristic Search
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9668openalex-snapshot
From Non-Negative to General Operator Cost Partitioning
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.11022openalex-snapshot
Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.11023openalex-snapshot
Higher-Dimensional Potential Heuristics for Optimal Classical Planning
inferred← citeshttps://doi.org/10.1609/aaai.v37i10.26469openalex-snapshot
Analyzing and Improving the Use of the FastMap Embedding in Pathfinding Tasks
inferred← citeshttps://doi.org/10.1609/icaps.v19i1.13384openalex-snapshot
hm(P) = h1(Pm): Alternative Characterisations of the Generalisation From hmax To hm
inferred← citeshttps://doi.org/10.1609/icaps.v20i1.13431openalex-snapshot
The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem
inferred← citeshttps://doi.org/10.1609/icaps.v22i1.13512openalex-snapshot
Predicting Optimal Solution Cost with Bidirectional Stratified Sampling
inferred← citeshttps://doi.org/10.1609/icaps.v24i1.13639openalex-snapshot
Diverse and Additive Cartesian Abstraction Heuristics
inferred← citeshttps://doi.org/10.1609/icaps.v26i1.13738openalex-snapshot
A Multi-Parameter Complexity Analysis of Cost-Optimal and Net-Benefit Planning
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13806openalex-snapshot
Abstraction Heuristics, Cost Partitioning and Network Flows
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13823openalex-snapshot
A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3496openalex-snapshot
Lagrangian Decomposition for Optimal Cost Partitioning
inferred← citeshttps://doi.org/10.1609/icaps.v30i1.6752openalex-snapshot
Utilising Uncertainty for Efficient Learning of Likely-Admissible Heuristics
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.15948openalex-snapshot
Exploiting Cyclic Dependencies in Landmark Heuristics
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.15964openalex-snapshot
LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19803openalex-snapshot
LM-Cut Heuristics for Optimal Linear Numeric Planning
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19819openalex-snapshot
New Refinement Strategies for Cartesian Abstractions
inferred← citeshttps://doi.org/10.1609/socs.v1i1.18159openalex-snapshot
Bootstrap Learning of Heuristic Functions
inferred← citeshttps://doi.org/10.1609/socs.v1i1.18162openalex-snapshot
Additive Heuristic for Four-Connected Gridworlds
inferred← citeshttps://doi.org/10.1609/socs.v1i1.18176openalex-snapshot
Landmark Heuristics for the Pancake Problem
inferred← citeshttps://doi.org/10.1609/socs.v2i1.18188openalex-snapshot
A Novel Technique for Compressing Pattern Databases in the Pancake Sorting Problems
inferred← citeshttps://doi.org/10.1609/socs.v2i1.18193openalex-snapshot
Size-Independent Additive Pattern Databases for the Pancake Problem
inferred← citeshttps://doi.org/10.1609/socs.v2i1.18196openalex-snapshot
Predicting Solution Cost with Conditional Probabilities
inferred← citeshttps://doi.org/10.1609/socs.v2i1.18203openalex-snapshot
Faster Optimal and Suboptimal Hierarchical Search
inferred← citeshttps://doi.org/10.1609/socs.v3i1.18237openalex-snapshot
Efficient Implementation of Pattern Database Heuristics for Classical Planning
inferred← citeshttps://doi.org/10.1609/socs.v6i1.18357openalex-snapshot
Solving the Snake in the Box Problem with Heuristic Search: First Results
inferred← citeshttps://doi.org/10.1609/socs.v8i1.18438openalex-snapshot
Better Orders for Saturated Cost Partitioning in Optimal Classical Planning
inferred← citeshttps://doi.org/10.1613/jair.1.11673openalex-snapshot
Saturated Cost Partitioning for Optimal Classical Planning
inferred← citeshttps://doi.org/10.1613/jair.1.12557openalex-snapshot
Merge-and-Shrink: A Compositional Theory of Transformations of Factored Transition Systems
inferred← citeshttps://doi.org/10.1613/jair.1.14034openalex-snapshot
The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions
inferred← citeshttps://doi.org/10.1613/jair.4443openalex-snapshot
Deterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations
inferred← citeshttps://doi.org/10.24963/ijcai.2017/599openalex-snapshot
Additive Merge-and-Shrink Heuristics for Diverse Action Costs
inferred← citeshttps://doi.org/10.24963/ijcai.2019/780openalex-snapshot
Pattern Selection for Optimal Classical Planning with Saturated Cost Partitioning
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-745openalex-snapshot
Relative-Order Abstractions for the Pancake Problem
inferred← citeshttps://doi.org/10.3233/aic-2011-0504openalex-snapshot
Implicit abstraction heuristics for cost-optimal planning
inferred← citeshttps://doi.org/10.3233/faia230377openalex-snapshot
Sensitivity Analysis for Saturated Post-Hoc Optimization in Classical Planning
inferred← citeshttps://doi.org/10.3384/diss.diva-136280openalex-snapshot
Computational Complexity of some Optimization Problems in Planning
inferred← citeshttps://doi.org/10.3390/computers12010011openalex-snapshot
The Fifteen Puzzle—A New Approach through Hybridizing Three Heuristics Methods
inferred← citeshttps://doi.org/10.5451/unibas-ep32799openalex-snapshot
Getting the most out of pattern databases for classical planning
inferred← citeshttps://doi.org/10.5451/unibas-ep59294openalex-snapshot
ERGO: A Framework for the Development of Autonomous Robots
inferred← citeshttps://doi.org/10.7939/r3668topenalex-snapshot
Cluster-and-Conquer: a Paradigm for Solving State-Space Problems
inferred← citeshttps://doi.org/10.7939/r3dw6topenalex-snapshot
Multimapping Abstraction and State-set Search Theory
inferred← citeshttps://doi.org/10.7939/r3qp6jopenalex-snapshot
Bootstrap Learning of Heuristic Functions
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.