@article{Scala_Grastien_2021, title={Non-Deterministic Conformant Planning Using a Counterexample-Guided Incremental Compilation to Classical Planning}, volume={31}, url={https://ojs.aaai.org/index.php/ICAPS/article/view/15974}, DOI={10.1609/icaps.v31i1.15974}, abstractNote={We address the problem of non-deterministic conformant planning, i.e., finding a plan in a non-deterministic context where the environment is not observable. Our approach uses an unsound but complete reduction from non-deterministic conformant planning to classical planning to find a candidate plan; the validity of this plan is then verified by a SAT solver; if the plan is invalid, the reduction is revised to guarantee that the invalid plan will not be valid in the classical planning problem. This procedure is executed until a valid plan is found, or it is shown that there is no plan. Experiments show that this approach provides a nice trade-off between fast but unsound, and complete but slow approaches.}, number={1}, journal={Proceedings of the International Conference on Automated Planning and Scheduling}, author={Scala, Enrico and Grastien, Alban}, year={2021}, month={May}, pages={299-307} }