On the public citation graph
Timelines Are Expressive Enough to Capture Action-Based Temporal Planning
0 signed · 34 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/10720246_18openalex-snapshot
Automata-Theoretic Approach to Planning for Temporally Extended Goals
inferredcites →https://doi.org/10.1007/978-3-642-04617-9_7openalex-snapshot
Flexible Timeline-Based Plan Verification
inferredcites →https://doi.org/10.1007/s00236-015-0252-zopenalex-snapshot
Planning and execution with flexible timelines: a formal account
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)90081-7openalex-snapshot
The computational complexity of propositional STRIPS planning
inferredcites →https://doi.org/10.1016/j.artint.2008.10.012openalex-snapshot
Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
inferredcites →https://doi.org/10.1023/a:1018985923441openalex-snapshot
Planning for temporally extended goals
inferredcites →https://doi.org/10.1023/a:1025842019552openalex-snapshot
Constraint-Based Attribute and Interval Planning
inferredcites →https://doi.org/10.1093/jigpal/7.1.27openalex-snapshot
Hybrid languages and temporal logic
inferredcites →https://doi.org/10.1109/ictai.2013.54openalex-snapshot
Controller Synthesis for Safety Critical Planning
inferredcites →https://doi.org/10.1109/time.2014.27openalex-snapshot
A Formal Account of Planning with Flexible Timelines
inferredcites →https://doi.org/10.1109/time.2015.16openalex-snapshot
An Executable Semantics of Flexible Plans in Terms of Timed Game Automata
inferredcites →https://doi.org/10.1145/182.358434openalex-snapshot
Maintaining knowledge about temporal intervals
inferredcites →https://doi.org/10.1609/aaai.v27i1.8601openalex-snapshot
Timelines with Temporal Uncertainty
inferredcites →https://doi.org/10.1609/icaps.v20i1.13410openalex-snapshot
Timeline-Based Space Operations Scheduling with External Constraints
inferredcites →https://doi.org/10.1613/jair.1129openalex-snapshot
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
inferredcites →https://doi.org/10.3233/978-1-60750-606-5-471openalex-snapshot
Analyzing Flexible Timeline-based Plans
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-032-40774-0_50openalex-snapshot
Pareto-Based Heuristic Search for Timelines
inferred← citeshttps://doi.org/10.1007/978-3-319-49130-1_37openalex-snapshot
Steps in Assessing a Timeline-Based Planner
inferred← citeshttps://doi.org/10.1007/978-3-319-99885-5_13openalex-snapshot
Challenges on the Application of Automated Planning for Comprehensive Geriatric Assessment Using an Autonomous Social Robot
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.12.030openalex-snapshot
Timeline-based planning over dense temporal domains
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.02.011openalex-snapshot
On timeline-based games and their complexity
inferred← citeshttps://doi.org/10.1109/maes.2019.2905922openalex-snapshot
ARIES: An Autonomous Controller For Multirobot Cooperation
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33017562openalex-snapshot
Efficiently Reasoning with Interval Constraints in Forward Search Planning
inferred← citeshttps://doi.org/10.1609/aaai.v34i06.6539openalex-snapshot
Decidability and Complexity of Action-Based Temporal Planning over Dense Time
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13830openalex-snapshot
Complexity of Timeline-Based Planning
inferred← citeshttps://doi.org/10.24963/ijcai.2017/140openalex-snapshot
Bounded Timed Propositional Temporal Logic with Past Captures Timeline-based Planning with Bounded Constraints
inferred← citeshttps://doi.org/10.24963/ijcai.2017/750openalex-snapshot
On the Complexity and Expressiveness of Automated Planning Languages Supporting Temporal Reasoning
inferred← citeshttps://doi.org/10.4204/eptcs.277.14openalex-snapshot
Complexity of Timeline-Based Planning over Dense Temporal Domains: Exploring the Middle Ground
inferred← citeshttps://doi.org/10.4204/eptcs.370.9openalex-snapshot
Controller Synthesis for Timeline-based Games
inferred← citeshttps://doi.org/10.4204/eptcs.409.5openalex-snapshot
Synthesis of Timeline-Based Planning Strategies Avoiding Determinization
inferred← citeshttps://doi.org/10.46298/lmcs-20(3:17)2024openalex-snapshot
Controller Synthesis for Timeline-based Games
inferred← citeshttps://doi.org/10.48550/arxiv.1901.03880openalex-snapshot
Model checking: the interval way
inferred← citeshttps://doi.org/10.48550/arxiv.1904.09184openalex-snapshot
Undecidability of future timeline-based planning over dense temporal domains
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.