On the public citation graph

Solving Simple Planning Problems with More Inference and No Search

0 signed · 28 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.1016/0004-3702(94)00076-dopenalex-snapshot
Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order 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.2005.08.004openalex-snapshot
Branching and pruning: An optimal temporal POCL planner based on constraint programming
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.1023/a:1026044009832openalex-snapshot
About the Authors
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.v15i4.1109openalex-snapshot
An Introduction to Least Commitment Planning
inferredcites →https://doi.org/10.1609/aimag.v22i3.1571openalex-snapshot
AIPS 2000 Planning Competition: The Fifth International Conference on Artificial Intelligence Planning and Scheduling Systems
inferredcites →https://doi.org/10.1613/jair.1146openalex-snapshot
Structure and Complexity in Planning with Unary Operators
inferredcites →https://doi.org/10.1613/jair.1240openalex-snapshot
The 3rd International Planning Competition: Results and Analysis
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/ada303260openalex-snapshot
Fast Planning Through Planning Graph Analysis.
inferredcites →https://doi.org/10.7551/mitpress/5625.001.0001openalex-snapshot
Programming with Constraints

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_1openalex-snapshot
Search and Inference in AI Planning
inferred← citeshttps://doi.org/10.1007/978-3-030-06167-8_10openalex-snapshot
Planning in Artificial Intelligence
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-540-75271-4_14openalex-snapshot
Efficient Pruning of Operators in Planning Domains
inferred← citeshttps://doi.org/10.1016/j.artint.2016.10.001openalex-snapshot
Efficient symbolic search for cost-optimal planning
inferred← citeshttps://doi.org/10.1016/j.artint.2019.103217openalex-snapshot
Landmark-based approaches for goal recognition as planning
inferred← citeshttps://doi.org/10.1016/j.mechatronics.2015.06.015openalex-snapshot
Symbolic discrete-time planning with continuous numeric action parameters for agent-controlled processes
inferred← citeshttps://doi.org/10.13140/rg.2.1.1058.2560openalex-snapshot
Les ressources et la planification temporelle.
inferred← citeshttps://doi.org/10.1609/icaps.v19i1.13376openalex-snapshot
Inference and Decomposition in Planning Using Causal Consistent Chains
inferred← citeshttps://doi.org/10.1609/icaps.v21i1.13470openalex-snapshot
Searching for Plans with Carefully Designed Probes
inferred← citeshttps://doi.org/10.1609/icaps.v22i1.13501openalex-snapshot
Tractable Monotone Temporal Planning
inferred← citeshttps://doi.org/10.1609/icaps.v25i1.13708openalex-snapshot
A Reminder about the Importance of Computing and Exploiting Invariants in Planning
inferred← citeshttps://doi.org/10.1609/socs.v4i1.18285openalex-snapshot
Constrained Symbolic Search: On Mutexes, BDD Minimization and More
inferred← citeshttps://doi.org/10.1613/jair.4358openalex-snapshot
Monotone Temporal Planning: Tractability, Extensions and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.2005.05712openalex-snapshot
Goal Recognition over Imperfect Domain Models
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.