Octagonal domains for continuous constraints

Authors:
Marie Pelleau;Charlotte Truchet;Frédéric Benhamou
Affiliations:
LINA, UMR CNRS 6241, Université de Nantes, France;LINA, UMR CNRS 6241, Université de Nantes, France;LINA, UMR CNRS 6241, Université de Nantes, France
Venue:
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Year:
2011

Citing 8
Cited 1

Temporal constraint networks

Proceedings of the first international conference on Principles of knowledge representation and reasoning
Revising hull and box consistency

Proceedings of the 1999 international conference on Logic programming
Algorithm 97: Shortest path

Communications of the ACM
Heterogeneous Constraint Solving

ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
The octagon abstract domain

Higher-Order and Symbolic Computation
A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Efficient constraint propagation engines

ACM Transactions on Programming Languages and Systems (TOPLAS)
Contractor programming

Artificial Intelligence

Refining abstract interpretation based value analysis with constraint programming techniques

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Domains in Continuous Constraint Programming (CP) are generally represented with intervals whose n-ary Cartesian product (box) approximates the solution space. This paper proposes a new representation for continuous variable domains based on octagons. We generalize local consistency and split to this octagon representation, and we propose an octagonal-based branch and prune algorithm. Preliminary experimental results show promising performance improvements on several classical benchmarks.