Conference Proceedings
Constraint propagation for loose constraint graphs
K Francis, PJ Stuckey
Proceedings of the ACM Symposium on Applied Computing | ASSOC COMPUTING MACHINERY | Published : 2007
Abstract
In this paper we investigate how to improve propagation-based finite domain constraint solving by making use of the constraint graph to choose propagators to execute in a better order. If the constraint graph is not too densely connected we can build an underlying tree of bi-connected components, and use this to order the choice of propagator. Our experiments show that there exist problems where handling biconnected components can substantially improve the propagation performance. Copyright 2007 ACM.