On the public citation graph
Implicit Abstraction Heuristics
0 signed · 67 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/11691617_2openalex-snapshot
Directed Model Checking with Distance-Preserving Abstractions
inferredcites →https://doi.org/10.1007/978-3-540-74128-2_3openalex-snapshot
Automated Creation of Pattern Database Search Heuristics
inferredcites →https://doi.org/10.1007/978-3-540-77723-6openalex-snapshot
Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition
inferredcites →https://doi.org/10.1007/bf00993063openalex-snapshot
Machine Discovery of Effective Admissible Heuristics
inferredcites →https://doi.org/10.1016/0004-3702(94)90081-7openalex-snapshot
The computational complexity of propositional STRIPS planning
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/j.artint.2010.04.021openalex-snapshot
Optimal admissible composition of abstraction heuristics
inferredcites →https://doi.org/10.1016/j.jcss.2009.10.013openalex-snapshot
Causal graphs and structurally restricted planning
inferredcites →https://doi.org/10.1016/s0004-3702(01)00108-4openalex-snapshot
Planning as heuristic search
inferredcites →https://doi.org/10.1016/s0004-3702(02)00364-8openalex-snapshot
Complexity results for standard benchmark domains in planning
inferredcites →https://doi.org/10.1016/s0004-3702(98)00003-4openalex-snapshot
State-variable planning under structural restrictions: algorithms and complexity
inferredcites →https://doi.org/10.1016/s0736-5853(86)80081-8openalex-snapshot
Heuristics: Intelligent Search Strategies for Computer Problem Solving
inferredcites →https://doi.org/10.1111/j.1467-8640.1995.tb00052.xopenalex-snapshot
COMPLEXITY RESULTS FOR SAS+ PLANNING
inferredcites →https://doi.org/10.1609/aimag.v21i4.1536openalex-snapshot
Admissible heuristics for optimal planning
inferredcites →https://doi.org/10.1609/icaps.v19i1.13351openalex-snapshot
Structural-Pattern Databases
inferredcites →https://doi.org/10.1609/icaps.v19i1.13370openalex-snapshot
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?
inferredcites →https://doi.org/10.1609/icaps.v20i1.13409openalex-snapshot
When Abstractions Met Landmarks
inferredcites →https://doi.org/10.1613/jair.1480openalex-snapshot
Additive Pattern Database Heuristics
inferredcites →https://doi.org/10.1613/jair.2486openalex-snapshot
A General Theory of Additive State Space Abstractions
inferredcites →https://doi.org/10.1613/jair.2817openalex-snapshot
Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings
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-37494-5_4openalex-snapshot
A General Approach to Distributed and Privacy-Preserving Heuristic Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-17665-9openalex-snapshot
Optimizing Liner Shipping Fleet Repositioning Plans
inferred← citeshttps://doi.org/10.1007/978-3-319-17665-9_5openalex-snapshot
Liner Shipping Fleet Repositioning Without Cargo
inferred← citeshttps://doi.org/10.1016/j.artint.2012.05.003openalex-snapshot
Landmark-enhanced abstraction heuristics
inferred← citeshttps://doi.org/10.1016/j.artint.2012.08.005openalex-snapshot
On the complexity of planning for agent teams and its implications for single agent planning
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.1109/ictai.2017.00093openalex-snapshot
Heuristic Approach to Guarantee Safe Solutions in Probabilistic Planning
inferred← citeshttps://doi.org/10.1609/aaai.v25i1.7829openalex-snapshot
Optimal Graph Search with Iterated Graph Cuts
inferred← citeshttps://doi.org/10.1609/aaai.v25i1.8009openalex-snapshot
Improving Cost-Optimal Domain-Independent Symbolic Planning
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8357openalex-snapshot
Structural Patterns Beyond Forks: Extending the Complexity Boundaries of Classical Planning
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9648openalex-snapshot
Some Fixed Parameter Tractability Results for Planning with Non-Acyclic Domain-Transition Graphs
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9649openalex-snapshot
Heuristics and Symmetries in Classical Planning
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9650openalex-snapshot
Tractable Cost-Optimal Planning over Restricted Polytree Causal Graphs
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9760openalex-snapshot
Impact of Modeling Languages on the Theory and Practice in Planning Research
inferred← citeshttps://doi.org/10.1609/icaps.v21i1.13447openalex-snapshot
When Optimal Is Just Not Good Enough: Learning Fast Informative Action Cost Partitionings
inferred← citeshttps://doi.org/10.1609/icaps.v22i1.13499openalex-snapshot
Optimal Search with Inadmissible Heuristics
inferred← citeshttps://doi.org/10.1609/icaps.v22i1.13500openalex-snapshot
Automated Planning for Liner Shipping Fleet Repositioning
inferred← citeshttps://doi.org/10.1609/icaps.v22i1.13531openalex-snapshot
Enhanced Symmetry Breaking in Cost-Optimal Planning as Forward Search
inferred← citeshttps://doi.org/10.1609/icaps.v23i1.13545openalex-snapshot
Abstractions for Oversubscription Planning
inferred← citeshttps://doi.org/10.1609/icaps.v23i1.13595openalex-snapshot
Symmetry Breaking: Satisficing Planning and Landmark Heuristics
inferred← citeshttps://doi.org/10.1609/icaps.v23i1.13598openalex-snapshot
What’s in It for My BDD? On Causal Graphs and Variable Orders in Planning
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13904openalex-snapshot
Symmetry-Based Task Reduction for Relaxed Reachability Analysis
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3482openalex-snapshot
Oversubscription Planning as Classical Planning with Multiple Cost Functions
inferred← citeshttps://doi.org/10.1609/socs.v16i1.27280openalex-snapshot
Generating SAS+ Planning Tasks of Specified Causal Structure
inferred← citeshttps://doi.org/10.1609/socs.v4i1.18294openalex-snapshot
Fast Detection of Unsolvable Planning Instances Using Local Consistency
inferred← citeshttps://doi.org/10.1609/socs.v9i1.18455openalex-snapshot
A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs
inferred← citeshttps://doi.org/10.1613/jair.1.11576openalex-snapshot
Strong Stubborn Set Pruning for Star-Topology Decoupled State Space Search
inferred← citeshttps://doi.org/10.1613/jair.4145openalex-snapshot
The Complexity of Optimal Monotonic Planning: The Bad, The Good, and The Causal Graph
inferred← citeshttps://doi.org/10.1613/jair.4443openalex-snapshot
Deterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations
inferred← citeshttps://doi.org/10.1613/jair.4586openalex-snapshot
BDD Ordering Heuristics for Classical Planning
inferred← citeshttps://doi.org/10.22028/d291-26439openalex-snapshot
What’s in it for my BDD? On causal graphs and variable orders in planning
inferred← citeshttps://doi.org/10.24963/ijcai.2018/647openalex-snapshot
Novel Structural Parameters for Acyclic Planning Using Tree Embeddings
inferred← citeshttps://doi.org/10.24963/ijcai.2019/848openalex-snapshot
A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs
inferred← citeshttps://doi.org/10.24963/ijcai.2021/558openalex-snapshot
Custom-Design of FDR Encodings: The Case of Red-Black Planning
inferred← citeshttps://doi.org/10.24963/ijcai.2021/576openalex-snapshot
The Fewer the Merrier: Pruning Preferred Operators with Novelty
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-33openalex-snapshot
Parameterising the Complexity of Planning by the Number of Paths in the Domain-transition Graphs
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-633openalex-snapshot
Landmarks in Oversubscription Planning
inferred← citeshttps://doi.org/10.3233/aic-2011-0504openalex-snapshot
Implicit abstraction heuristics for cost-optimal planning
inferred← citeshttps://doi.org/10.3233/aic-230058openalex-snapshot
Revisiting block deordering in finite-domain state variable planning
inferred← citeshttps://doi.org/10.3384/diss.diva-136280openalex-snapshot
Computational Complexity of some Optimization Problems in Planning
inferred← citeshttps://doi.org/10.3384/diss.diva-139802openalex-snapshot
Methods for Detecting Unsolvable Planning Instances using Variable Projection
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.135-136.573openalex-snapshot
Heuristics for Domain-Independent Planning: A Survey
inferred← citeshttps://doi.org/10.4304/jsw.7.9.2099-2106openalex-snapshot
A Survey of Heuristics for Domain-Independent Planning
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.