Complexity of qualitative timeline-based planning

DOI10.4230/LIPICS.TIME.2020.16MaRDI QIDQ6060102zbMATH OpenOpenAlexFDO

Authors Dario Della Monica, Nicola Gigante, Salvatore La Torre, Angelo Montanari

Publication date 2 November 2023

Full work available at URL https://doi.org/10.4230/LIPIcs.TIME.2020.16

zbMATH Keywords

complexitytimeline-based planningqualitative temporal constraints

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Complexity of timeline-based planning over dense temporal domains: exploring the middle ground
• Complexity issues for timeline-based planning over dense time under future and minimal semantics
• Complexity classification in qualitative temporal constraint reasoning
• On the computational complexity of temporal projection, planning, and plan validation
• Decidability and complexity of action-based temporal planning over dense time
• Taming the complexity of timeline-based planning over dense temporal domains
• scientific article; zbMATH DE number 1536550
• Refining complexity analyses in planning by exploiting the exponential time hypothesis
• scientific article; zbMATH DE number 140366
• Time and Space Bounds for Planning

Cites work

• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 2201583 (Why is no real title available?)
• Maintaining knowledge about temporal intervals
• On timeline-based games and their complexity
• STRIPS: A new approach to the application of theorem proving to problem solving

Cited in

(4)

• Controller synthesis for timeline-based games
• Controller synthesis for timeline-based games
• scientific article; zbMATH DE number 5887274 (Why is no real title available?)
• scientific article; zbMATH DE number 5666460 (Why is no real title available?)

This page was built for publication: Complexity of qualitative timeline-based planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6060102)