Timeline-Based Planning over Dense Temporal Domains with Trigger-less Rules is NP-Complete

Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Gerhard J. Woeginger. Timeline-Based Planning over Dense Temporal Domains with Trigger-less Rules is NP-Complete. In Alessandro Aldini, Marco Bernardo 0001, editors, Proceedings of the 19th Italian Conference on Theoretical Computer Science, Urbino, Italy, September 18-20, 2018. Volume 2243 of CEUR Workshop Proceedings, pages 116-127, CEUR-WS.org, 2018. [doi]

Abstract

Abstract is missing.