On the public citation graph

Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+

0 signed · 81 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/10720246_11openalex-snapshot
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
inferredcites →https://doi.org/10.1007/3-540-63912-8_97openalex-snapshot
Ignoring irrelevant facts and operators in plan generation
inferredcites →https://doi.org/10.1007/b93903openalex-snapshot
Utilizing Problem Structure in Planning: A Local Search Approach
inferredcites →https://doi.org/10.1016/0004-3702(94)90069-8openalex-snapshot
Automatically generating abstractions for planning
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/j.artint.2008.10.013openalex-snapshot
Concise finite-domain representations for PDDL planning tasks
inferredcites →https://doi.org/10.1016/j.artint.2008.11.009openalex-snapshot
Learning from planner performance
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(96)00047-1openalex-snapshot
Fast planning through planning graph analysis
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/s0004-3702(99)00010-7openalex-snapshot
Using regression-match graphs to control search in planning
inferredcites →https://doi.org/10.1111/j.1467-8640.1991.tb00393.xopenalex-snapshot
Planning in polynomial time: the SAS‐PUBS class
inferredcites →https://doi.org/10.1111/j.1467-8640.1995.tb00052.xopenalex-snapshot
COMPLEXITY RESULTS FOR SAS+ PLANNING
inferredcites →https://doi.org/10.1515/9781618117021openalex-snapshot
Landmarks Revisited
inferredcites →https://doi.org/10.1609/aimag.v20i2.1459openalex-snapshot
Recent Advances in AI Planning
inferredcites →https://doi.org/10.1609/icaps.v19i1.13349openalex-snapshot
The Influence of k-Dependence on the Complexity of Planning
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.1613/jair.1146openalex-snapshot
Structure and Complexity in Planning with Unary Operators
inferredcites →https://doi.org/10.1613/jair.1183openalex-snapshot
Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
inferredcites →https://doi.org/10.1613/jair.2432openalex-snapshot
The Complexity of Planning Problems With Simple Causal Graphs
inferredcites →https://doi.org/10.1613/jair.2498openalex-snapshot
New Islands of Tractability of Cost-Optimal Planning
inferredcites →https://doi.org/10.1613/jair.2742openalex-snapshot
Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard
inferredcites →https://doi.org/10.1613/jair.2891openalex-snapshot
The Role of Macros in Tractable Planning
inferredcites →https://doi.org/10.1613/jair.544openalex-snapshot
The Automatic Inference of State Invariants in TIM
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.21236/ada269772openalex-snapshot
Automatically Generating Abstractions for Planning

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-38561-3_11openalex-snapshot
Web Planner: A Tool to Develop, Visualize, and Test Classical Planning Domains
inferred← citeshttps://doi.org/10.1007/978-3-030-38561-3_5openalex-snapshot
KEPS Book: Planning.Domains
inferred← citeshttps://doi.org/10.1007/978-3-642-24455-1_1openalex-snapshot
Everything You Always Wanted to Know about Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-30353-1_2openalex-snapshot
Macro Learning in Planning as Parameter Configuration
inferred← citeshttps://doi.org/10.1016/j.artint.2014.12.008openalex-snapshot
Red–black planning: A new systematic approach to partial delete relaxation
inferred← citeshttps://doi.org/10.1016/j.artint.2015.01.004openalex-snapshot
The deterministic part of the seventh International Planning Competition
inferred← citeshttps://doi.org/10.1016/j.artint.2016.12.002openalex-snapshot
State space search nogood learning: Online refinement of critical-path dead-end detectors in planning
inferred← citeshttps://doi.org/10.1016/j.engappai.2013.04.006openalex-snapshot
Post-design analysis for building and refining AI planning systems
inferred← citeshttps://doi.org/10.1017/s0269888918000012openalex-snapshot
What you always wanted to know about the deterministic part of the International Planning Competition (IPC) 2014 (but were too afraid to ask)
inferred← citeshttps://doi.org/10.1080/0952813x.2017.1409278openalex-snapshot
PDDL4J: a planning domain description library for java
inferred← citeshttps://doi.org/10.1080/0952813x.2021.1970239openalex-snapshot
Improving Domain-Independent Heuristic State-Space Planning via plan cost predictions
inferred← citeshttps://doi.org/10.1109/ictai.2018.00081openalex-snapshot
Determining Representativeness of Training Plans: A Case of Macro-Operators
inferred← citeshttps://doi.org/10.1111/coin.12211openalex-snapshot
On the predictability of domain‐independent temporal planners
inferred← citeshttps://doi.org/10.1142/s0218213017600065openalex-snapshot
Static and Dynamic Portfolio Methods for Optimal Planning: An Empirical Analysis
inferred← citeshttps://doi.org/10.1145/3148011.3148012openalex-snapshot
Engineering Knowledge for Automated Planning
inferred← citeshttps://doi.org/10.1162/evco_a_00242openalex-snapshot
Automated Algorithm Selection: Survey and Perspectives
inferred← citeshttps://doi.org/10.1184/r1/6722891openalex-snapshot
Short-Sighted Probabilistic Planning
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8644openalex-snapshot
Red-Black Relaxed Plan Heuristics
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10071openalex-snapshot
Tiebreaking Strategies for A* Search: How to Explore the Final Frontier
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33017546openalex-snapshot
Improving Domain-Independent Planning via Critical Section Macro-Operators
inferred← citeshttps://doi.org/10.1609/aaai.v37i10.26418openalex-snapshot
Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains
inferred← citeshttps://doi.org/10.1609/icaps.v21i1.13469openalex-snapshot
Where Ignoring Delete Lists Works, Part II: Causal Graphs
inferred← citeshttps://doi.org/10.1609/icaps.v23i1.13548openalex-snapshot
Who Said We Need to Relax All Variables?
inferred← citeshttps://doi.org/10.1609/icaps.v24i1.13680openalex-snapshot
Improved Features for Runtime Prediction of Domain-Independent Planners
inferred← citeshttps://doi.org/10.1609/icaps.v25i1.13715openalex-snapshot
Identifying and Exploiting Features for Effective Plan Retrieval in Case-Based Planning
inferred← citeshttps://doi.org/10.1609/icaps.v26i1.13774openalex-snapshot
Traps, Invariants, and Dead-Ends
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13848openalex-snapshot
Performance Modelling of Planners from Homogeneous Problem Sets
inferred← citeshttps://doi.org/10.1609/icaps.v30i1.6753openalex-snapshot
Generating and Exploiting Cost Predictions in Heuristic State-Space Planning
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19821openalex-snapshot
Learning to Estimate Search Progress Using Sequence of States
inferred← citeshttps://doi.org/10.1609/icaps.v34i1.31472openalex-snapshot
New Fuzzing Biases for Action Policy Testing
inferred← citeshttps://doi.org/10.1609/socs.v17i1.31542openalex-snapshot
Modeling Assistance for Hierarchical Planning: An Approach for Correcting Hierarchical Domains with Missing Actions
inferred← citeshttps://doi.org/10.1609/socs.v6i1.18348openalex-snapshot
From Fork Decoupling to Star-Topology Decoupling
inferred← citeshttps://doi.org/10.1609/socs.v6i1.18352openalex-snapshot
Building a Heuristic for Greedy 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.4586openalex-snapshot
BDD Ordering Heuristics for Classical Planning
inferred← citeshttps://doi.org/10.1613/jair.5036openalex-snapshot
Effective Heuristics for Suboptimal Best-First Search
inferred← citeshttps://doi.org/10.1613/jair.5057openalex-snapshot
Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization
inferred← citeshttps://doi.org/10.1613/jair.5080openalex-snapshot
The IBaCoP Planning System: Instance-Based Configured Portfolios
inferred← citeshttps://doi.org/10.1613/jair.5249openalex-snapshot
Tie-Breaking Strategies for Cost-Optimal Best First Search
inferred← citeshttps://doi.org/10.2200/s00513ed1v01y201306aim022openalex-snapshot
A Concise Introduction to Models and Methods for Automated Planning
inferred← citeshttps://doi.org/10.24963/ijcai.2017/602openalex-snapshot
Beyond Forks: Finding and Ranking Star Factorings for Decoupled Search
inferred← citeshttps://doi.org/10.25911/5d6c3a9454f26openalex-snapshot
Using Plan Decomposition for Continuing Plan Optimisation and Macro Generation
inferred← citeshttps://doi.org/10.3233/978-1-61499-098-7-240openalex-snapshot
On Exploiting Structures of Classical Planning Problems: Generalizing Entanglements
inferred← citeshttps://doi.org/10.3233/978-1-61499-098-7-540openalex-snapshot
Width and Serialization of Classical Planning Problems
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/aic-140603openalex-snapshot
Towards a theory of random walk planning: Regress factors, fair homogeneous graphs and extensions
inferred← citeshttps://doi.org/10.3233/aic-150679openalex-snapshot
On the completeness of replacing primitive actions with macro-actions and its generalization to planning operators and macro-operators
inferred← citeshttps://doi.org/10.3233/aic-170537openalex-snapshot
Performance robustness of AI planners in the 2014 International Planning Competition
inferred← citeshttps://doi.org/10.3233/fi-2016-1447openalex-snapshot
Identifying and Exploiting Features for Effective Plan Retrieval in Case-Based Planning
inferred← citeshttps://doi.org/10.32920/ryerson.14654637openalex-snapshot
Organic chemistry synthesis problem as artificial intelligence planning
inferred← citeshttps://doi.org/10.32920/ryerson.14654637.v1openalex-snapshot
Organic chemistry synthesis problem as artificial intelligence planning
inferred← citeshttps://doi.org/10.48550/arxiv.1811.11597openalex-snapshot
Automated Algorithm Selection: Survey and Perspectives
inferred← citeshttps://doi.org/10.7939/r3896qopenalex-snapshot
Random Walk Planning: Theory, Practice, and Application
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.