@article{Pandey_Rintanen_2018, title={Planning for Partial Observability by SAT and Graph Constraints}, volume={28}, url={https://ojs.aaai.org/index.php/ICAPS/article/view/13896}, DOI={10.1609/icaps.v28i1.13896}, abstractNote={ <p> Chatterjee et al. have recently shown the utility of SAT in solving a class of planning problems with partial observability. A core component of their logical formulation of planning is constraints expressing s-t-reachability in directed graphs. In this work, we show that the scalability of the approach can be dramatically improved by using dedicated graph constraints, and that a far broader class of important planning problems can be expressed in terms of s-t-reachability and acyclicity constraints. </p> }, number={1}, journal={Proceedings of the International Conference on Automated Planning and Scheduling}, author={Pandey, Binda and Rintanen, Jussi}, year={2018}, month={Jun.}, pages={190-198} }