Augmenting Stream Constraint Programming with Eventuality Conditions
Stream constraint programming is a recent addition to the family of constraint programming frameworks, where variable domains are sets of infinite streams over finite alphabets. Previous works showed promising results for its applicability to real-world planning and control problems. In this paper, motivated by the modelling of planning applications, we improve the expressiveness of the framework by introducing (1) the “until” constraint, a new construct that is adapted from Linear Temporal Logic and (2) the @ operator on streams, a syntactic sugar for which we provide a more efficient solving algorithm over simple desugaring. For both constructs, we propose corresponding novel solving algorithms and prove their correctness. We present competitive experimental results on the Missionaries and Cannibals logic puzzle and a standard path planning application on the grid, by comparing with Apt and Brand’s method for verifying eventuality conditions using a CP approach.
- 2.van Beek, P., Chen, X.: CPlan: a constraint programming approach to planning. In: Proceedings of AAAI 1999/IAAI 1999, pp. 585–590 (1999)Google Scholar
- 8.Harabor, D., Grastien, A.: Online graph pruning for pathfinding on grid maps. In: Proceedings of AAAI 2011, pp. 1114–1119 (2011)Google Scholar
- 9.Kautz, H., Selman, B.: Planning as satisfiability. In: Proceedings of ECAI 1992, pp. 359–363 (1992)Google Scholar
- 11.Lallouet, A., Law, Y.C., Lee, J.H.M., Siu, C.F.K.: Constraint programming on infinite data streams. In: Proceedings of IJCAI 2011, pp. 597–604 (2011)Google Scholar
- 14.Pnueli, A.: The temporal logic of programs. In: Proceedings of FOCS 1977, pp. 46–57 (1977)Google Scholar