Abstract
Domains in continuous constraint programming are generally represented with intervals whose n-ary Cartesian product (box) approximates the solution space. In this article, we generalize this representation and propose a generic solver where other domains representations can be used. In this framework, we define a new representation for continuous domains based on octagons. We generalize local consistency and split to this octagon representation. Experimental results show promising performance improvements on several classical benchmarks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Apt, K.R. (1999). The essence of constraint propagation. Theoretical Computer Science, 221.
Araya, I., Trombettoni, G., Neveu, B. (2010). Exploiting monotonicity in interval constraint propagation. In Proceedings of the 24th AAAI conference on artificial intelligence. AAAI.
Benhamou, F. (1996). Heterogeneous constraint solvings. In Proceedings of the 5th international conference on algebraic and logic programming (pp. 62–76).
Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.F. (1999). Revisiting hull and box consistency. In Proceedings of the 16th international conference on logic programming (pp. 230–244).
Chabert, G., & Jaulin, L. (2009). Contractor programming. Artificial Intelligence, 173, 1079–1100.
Chen, L., Miné, A., Wang, J., Cousot, P. (2009). Interval polyhedra: An abstract domain to infer interval linear relationships. In Proceedings of the 16th international static analysis symposium (SAS’09) (pp. 309–325).
Cousot, P., & Cousot, R. (1976). Static determination of dynamic properties of programs. In Proceedings of the 2nd international symposium on programming (pp. 106–130).
Dechter, R., Meiri, I., Pearl, J. (1989). Temporal constraint networks. In Proceedings of the first international conference on principles of knowledge representation and reasoning.
Floyd, R. (1962). Algorithm 97: shortest path. Communications of the ACM, 5(6).
Goldberg, D. (1991). What every computer scientist should know about floating point arithmetic. ACM Computing Surveys, 23(1), 5–48.
Goldsztejn, A., & Granvilliers, L. (2010). A new framework for sharp and efficient resolution of ncsp with manifolds of solutions. Constraints, 15(2), 190–212.
Menasche. M., & Berthomieu, B. (1983). Time petri nets for analyzing and verifying time dependent communication protocols. In Protocol specification, testing, and verification.
Miné, A. (2004). Domaines numériques abstraits faiblement relationnels. Ph.D. thesis, École Normale Supérieure.
Miné, A. (2006). The octagon abstract domain. Higher-Order and Symbolic Computation, 19(1), 31–100.
Régin, J.C., & Rueher, M. (2005). Inequality-sum : a global constraint capturing the objective function: RAIRO Operations Research.
Rossi, F., van Beek, P., Walsh, T. (2006). Handbook of constraint programming (Foundations of Artificial Intelligence). Elsevier.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pelleau, M., Truchet, C. & Benhamou, F. The octagon abstract domain for continuous constraints. Constraints 19, 309–337 (2014). https://doi.org/10.1007/s10601-014-9162-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10601-014-9162-x