Complexity of qualitative timeline-based planning

DOI10.4230/LIPICS.TIME.2020.16OpenAlexW3089402609MaRDI QIDQ6060102FDOQ6060102

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

Recommendations

• scientific article
• 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
• scientific article; zbMATH DE number 7650331
• 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

zbMATH Keywords

complexitytimeline-based planningqualitative temporal constraints

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Maintaining knowledge about temporal intervals
• STRIPS: A new approach to the application of theorem proving to problem solving
• Title not available (Why is that?)
• Title not available (Why is that?)
• On timeline-based games and their complexity

Cited In (4)

• Controller synthesis for timeline-based games
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)