On the public citation graph
The Complexity of Planning Problems With Simple Causal Graphs
0 signed · 38 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.1016/0004-3702(71)90010-5openalex-snapshot
Strips: A new approach to the application of theorem proving to problem solving
inferredcites →https://doi.org/10.1016/0004-3702(94)00080-kopenalex-snapshot
Complexity, decidability and undecidability results for domain-independent planning
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/s0004-3702(02)00364-8openalex-snapshot
Complexity results for standard benchmark domains in planning
inferredcites →https://doi.org/10.1613/jair.1146openalex-snapshot
Structure and Complexity in Planning with Unary Operators
inferredcites →https://doi.org/10.1613/jair.1696openalex-snapshot
Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10458-020-09481-8openalex-snapshot
Interactive task learning via embodied corrective feedback
inferred← citeshttps://doi.org/10.1016/j.artint.2011.12.002openalex-snapshot
The influence of k-dependence on the complexity of planning
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.2014.02.002openalex-snapshot
Limitations of acyclic causal graphs for planning
inferred← citeshttps://doi.org/10.1016/j.artint.2017.12.004openalex-snapshot
Star-topology decoupled state space search
inferred← citeshttps://doi.org/10.1016/j.jcss.2009.10.013openalex-snapshot
Causal graphs and structurally restricted planning
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.04.002openalex-snapshot
A complete parameterized complexity analysis of bounded planning
inferred← citeshttps://doi.org/10.1016/j.scs.2026.107592openalex-snapshot
Toward interpretable urban spatial layout generation: Encoding domain knowledge into graph neural networks
inferred← citeshttps://doi.org/10.1088/1757-899x/335/1/012068openalex-snapshot
Implementation Authentic Task to Enhance Problem Solving and Self-Management for Physics College Students
inferred← citeshttps://doi.org/10.1109/access.2018.2837340openalex-snapshot
Structure Learning of Conditional Preference Networks Based on Dependent Degree of Attributes From Preference Database
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.v26i1.8361openalex-snapshot
The Complexity of Planning Revisited — A Parameterized Analysis
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.9650openalex-snapshot
Tractable Cost-Optimal Planning over Restricted Polytree Causal Graphs
inferred← citeshttps://doi.org/10.1609/aaai.v37i10.26428openalex-snapshot
Structurally Restricted Fragments of Numeric Planning – a Complexity Analysis
inferred← citeshttps://doi.org/10.1609/icaps.v19i1.13349openalex-snapshot
The Influence of k-Dependence on the Complexity of Planning
inferred← citeshttps://doi.org/10.1609/icaps.v21i1.13446openalex-snapshot
Limits for Compact Representation of Plans
inferred← citeshttps://doi.org/10.1609/icaps.v23i1.13550openalex-snapshot
When Acyclicity Is Not Enough: Limitations of the Causal Graph
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3507openalex-snapshot
On Computational Complexity of Automorphism Groups in Classical Planning
inferred← citeshttps://doi.org/10.1609/icaps.v33i1.27189openalex-snapshot
Planning over Integers: Compilations and Undecidability
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.v9i1.18455openalex-snapshot
A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs
inferred← citeshttps://doi.org/10.1613/jair.2742openalex-snapshot
Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard
inferred← citeshttps://doi.org/10.1613/jair.2891openalex-snapshot
The Role of Macros in Tractable Planning
inferred← citeshttps://doi.org/10.1613/jair.3276openalex-snapshot
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
inferred← citeshttps://doi.org/10.1613/jair.3534openalex-snapshot
Algorithms and Limits for Compact Plan Representations
inferred← citeshttps://doi.org/10.1613/jair.3968openalex-snapshot
A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond
inferred← citeshttps://doi.org/10.1613/jair.4586openalex-snapshot
BDD Ordering Heuristics for Classical Planning
inferred← citeshttps://doi.org/10.3384/diss.diva-139802openalex-snapshot
Methods for Detecting Unsolvable Planning Instances using Variable Projection
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.