On the public citation graph
Structure and Complexity in Planning with Unary Operators
0 signed · 87 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(85)90012-8openalex-snapshot
Macro-operators: A weak method for learning
inferredcites →https://doi.org/10.1016/0004-3702(87)90051-8openalex-snapshot
Planning as search: A quantitative approach
inferredcites →https://doi.org/10.1016/0004-3702(87)90092-0openalex-snapshot
Planning for conjunctive goals
inferredcites →https://doi.org/10.1016/0004-3702(93)90080-uopenalex-snapshot
Acquiring search-control knowledge via static analysis
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(98)00003-4openalex-snapshot
State-variable planning under structural restrictions: algorithms and complexity
inferredcites →https://doi.org/10.1023/a:1018995620232openalex-snapshot
Tractable plan existence does not imply tractable plan generation
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.1145/267658.267724openalex-snapshot
An autonomous spacecraft agent prototype
inferredcites →https://doi.org/10.1609/aimag.v15i4.1109openalex-snapshot
An Introduction to Least Commitment Planning
inferredcites →https://doi.org/10.1609/aimag.v20i2.1459openalex-snapshot
Recent Advances in AI 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.715openalex-snapshot
On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm
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/11564751_50openalex-snapshot
Solving Simple Planning Problems with More Inference and No Search
inferred← citeshttps://doi.org/10.1007/3-540-36233-9_1openalex-snapshot
Information Systems That Also Project into the Future
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_69openalex-snapshot
Monotone Temporal Planning: Tractability, Extensions and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_19openalex-snapshot
Transition-Based Directed Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-03237-0_8openalex-snapshot
The Causal Graph Revisited for Directed Model Checking
inferred← citeshttps://doi.org/10.1016/j.array.2026.101314openalex-snapshot
Locality-based moral planning with linear temporal logic values
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.2014.12.008openalex-snapshot
Red–black planning: A new systematic approach to partial delete relaxation
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.artint.2018.02.002openalex-snapshot
Symbolic perimeter abstraction heuristics for cost-optimal planning
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/s0004-3702(03)00110-3openalex-snapshot
Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
inferred← citeshttps://doi.org/10.1080/0952813x.2017.1409278openalex-snapshot
PDDL4J: a planning domain description library for java
inferred← citeshttps://doi.org/10.1109/wi-iatw.2006.127openalex-snapshot
The 'MECIMPLAN' Approach to Agent-Based Strategic Planning
inferred← citeshttps://doi.org/10.1504/ijiids.2009.025159openalex-snapshot
MECIMPLAN: an agent-based methodology for 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.v26i1.8361openalex-snapshot
The Complexity of Planning Revisited — A Parameterized Analysis
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.9025openalex-snapshot
Oversubscription Planning: Complexity and Compilability
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.9656openalex-snapshot
tBurton: A Divide and Conquer Temporal Planner
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.v21i1.13469openalex-snapshot
Where Ignoring Delete Lists Works, Part II: Causal Graphs
inferred← citeshttps://doi.org/10.1609/icaps.v22i1.13501openalex-snapshot
Tractable Monotone Temporal Planning
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.v25i1.13705openalex-snapshot
Beating LM-Cut with h^max (Sometimes): Fork-Decoupled State Space Search
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13805openalex-snapshot
Beyond Red-Black Planning: Limited-Memory State Variables
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3501openalex-snapshot
Advanced Factoring Strategies for Decoupled Search Using Linear Programming
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.v30i1.6649openalex-snapshot
Certified Unsolvability for SAT Planning with Property Directed Reachability
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19846openalex-snapshot
Reinforcement Learning for Classical Planning: Viewing Heuristics as Dense Reward Generators
inferred← citeshttps://doi.org/10.1609/icaps.v34i1.31484openalex-snapshot
An Analysis of the Decidability and Complexity of Numeric Additive Planning
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.v6i1.18348openalex-snapshot
From Fork Decoupling to Star-Topology Decoupling
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.1.12283openalex-snapshot
Computational Complexity of Computing Symmetries in Finite-Domain Planning
inferred← citeshttps://doi.org/10.1613/jair.1234openalex-snapshot
CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements
inferred← citeshttps://doi.org/10.1613/jair.2432openalex-snapshot
The Complexity of Planning Problems With Simple Causal Graphs
inferred← citeshttps://doi.org/10.1613/jair.2498openalex-snapshot
New Islands of Tractability of Cost-Optimal Planning
inferred← citeshttps://doi.org/10.1613/jair.2627openalex-snapshot
The Computational Complexity of Dominance and Consistency in CP-Nets
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.4358openalex-snapshot
Monotone Temporal Planning: Tractability, Extensions and Applications
inferred← citeshttps://doi.org/10.1613/jair.4586openalex-snapshot
BDD Ordering Heuristics for Classical 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.24963/ijcai.2018/647openalex-snapshot
Novel Structural Parameters for Acyclic Planning Using Tree Embeddings
inferred← citeshttps://doi.org/10.24963/ijcai.2023/603openalex-snapshot
Topological Planning with Post-unique and Unary Actions
inferred← citeshttps://doi.org/10.3233/978-1-58603-891-5-588openalex-snapshot
Heuristics for Planning with Action Costs Revisited
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.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.48550/arxiv.1203.3538openalex-snapshot
RAPID: A Reachable Anytime Planner for Imprecisely-sensed Domains
inferred← citeshttps://doi.org/10.48550/arxiv.1310.7828openalex-snapshot
A Complete Parameterized Complexity Analysis of Bounded Planning
inferred← citeshttps://doi.org/10.48550/arxiv.1401.3453openalex-snapshot
The Computational Complexity of Dominance and Consistency in CP-Nets
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0610095openalex-snapshot
Solving planning domains with polytree causal graphs is NP-complete
inferred← citeshttps://doi.org/10.5451/unibas-ep45240openalex-snapshot
Decoupled Strong Stubborn Sets
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-340openalex-snapshot
Bounded intention planning
showing the first 68 of 69 · page through all 69
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.