AI RESEARCH

Synthesis of timeline-based planning strategies avoiding determinization

arXiv CS.AI

ArXi:2507.17988v2 Announce Type: replace Qualitative timeline-based planning models domains as sets of independent, but interacting, components whose behaviors over time, the timelines, are governed by sets of qualitative temporal constraints (ordering relations), called synchronization rules. Its plan-existence problem has been shown to be PSPACE-complete; in particular, PSPACE-membership has been proved via reduction to the nonemptiness problem for nondeterministic finite automata.