Peter Baumgartner, Sylvie Thiébaux, and Felipe Trevizan.
Heuristic Search Planning With Multi-Objective Probabilistic LTL Constraints.
In Frank Wolter Michael Thielscher, Francesca Toni, editor, KR-2018 -- 16th International Conference on Principles of Knowledge Representation and Reasoning, pages 415--424. AAAI Press, 2018.
AAAI Press.
Correction: The complexity result in Theorem 4 is incorrect. The incorrectnes is based on an oversight in the use of a Tseitin-style CNF transformation when progressing LTL formulas to the next state. A correct progression-based algorithm, of higher complexity though, employs standard CNF instead. The soundness theorem (Theorem 5), and completeness theorem (Theorem 6) still apply with that correction. Moreover, and importantly, it is such a correct version that we had implemented and used in our experiments. The experimental results, hence, are not affected by the incorrectnes, and neither are the other results. [ bib | .pdf | Abstract ]