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.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2007 ACM Symposium on Applied Computing |
Pages | 334-335 |
Number of pages | 2 |
DOIs | |
Publication status | Published - 18 Oct 2007 |
Externally published | Yes |
Event | ACM Symposium on Applied Computing 2007 - Seoul, Korea, South Duration: 11 Mar 2007 → 15 Mar 2007 Conference number: 22nd https://dl.acm.org/doi/proceedings/10.1145/1244002 (Proceedings) |
Conference
Conference | ACM Symposium on Applied Computing 2007 |
---|---|
Abbreviated title | SAC 2007 |
Country/Territory | Korea, South |
City | Seoul |
Period | 11/03/07 → 15/03/07 |
Internet address |
|
Keywords
- Constraint graph
- Constraint propagation