Timeline-based planning in the dense-time setting has been recently shown to be undecidable in the general case, and undecidability relies on ...

The present work focuses on timeline-based planning over dense temporal domains. In automated planning, the temporal domain is commonly assumed to be discrete, ...

Apr 12, 2020 · We first prove that dense TP is undecidable in the general case; then, we show that decidability can be recovered by restricting to ...

Dec 10, 2020 · The present work focuses on timeline-based planning over dense temporal domains. In automated planning, the temporal domain is commonly ...

In this paper, we consider the timeline-based approach, where the domain is modeled by a set of independent, but interacting, components, identified by a set of ...

The present work focuses on timeline-based planning over dense temporal domains. In automated planning, the temporal domain is commonly assumed to be discrete, ...

... 2756/paper16. Laura Bozzelli Alberto Molinari Angelo Montanari Adriano Peron. Undecidability of Future Timeline-based Planning over Dense Temporal Domains?

Jan 12, 2022 · The problem of timeline-based planning (TP) over dense temporal domains is known to be undecidable in the general case.

We analyzed this case as the unrestricted version of the problem is known to be undecidable [3]. In future work, we will focus on decidability and complexity of ...

This paper strengthens the previous negative result by showing that undecidability already holds under the future semantics of the trigger rules which ...