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]

Authors

Laura Bozzelli

This author has not been identified. Look up 'Laura Bozzelli' in Google

Alberto Molinari

This author has not been identified. Look up 'Alberto Molinari' in Google

Angelo Montanari

This author has not been identified. Look up 'Angelo Montanari' in Google

Adriano Peron

This author has not been identified. Look up 'Adriano Peron' in Google

Gerhard J. Woeginger

This author has not been identified. Look up 'Gerhard J. Woeginger' in Google