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]

@inproceedings{BozzelliMMPW18,
  title = {Timeline-Based Planning over Dense Temporal Domains with Trigger-less Rules is NP-Complete},
  author = {Laura Bozzelli and Alberto Molinari and Angelo Montanari and Adriano Peron and Gerhard J. Woeginger},
  year = {2018},
  url = {http://ceur-ws.org/Vol-2243/paper11.pdf},
  researchr = {https://researchr.org/publication/BozzelliMMPW18},
  cites = {0},
  citedby = {0},
  pages = {116-127},
  booktitle = {Proceedings of the 19th Italian Conference on Theoretical Computer Science, Urbino, Italy, September 18-20, 2018},
  editor = {Alessandro Aldini and Marco Bernardo 0001},
  volume = {2243},
  series = {CEUR Workshop Proceedings},
  publisher = {CEUR-WS.org},
}