Abstract
Set bounds propagation is the most popular approach to solving constraint satisfaction problems (CSPs) involving set variables. The use of reduced ordered Binary Decision Diagrams (BDDs) to represent and solve set CSPs is well understood and brings the advantage that propagators for arbitrary set constraints can be built. This can substantially improve solving. The disadvantages of BDDs is that creating and manipulating BDDs can be expensive. In this paper we show how we can perform set bounds propagation using BDDs in a much more efficient manner by generically creating set constraint predicates, and using a marking approach to propagation. The resulting system can be significantly faster than competing approaches to set bounds propagation.
Original language | English |
---|---|
Title of host publication | Frontiers in Artificial Intelligence and Applications |
Publisher | IOS Press |
Pages | 505-509 |
Number of pages | 5 |
ISBN (Print) | 978158603891 |
DOIs | |
Publication status | Published - 1 Jan 2008 |
Externally published | Yes |
Event | European Conference on Artificial Intelligence 2008 - Patras, Greece Duration: 21 Jul 2008 → 25 Jul 2008 Conference number: 18th |
Publication series
Name | Frontiers in Artificial Intelligence and Applications |
---|---|
Volume | 178 |
ISSN (Print) | 0922-6389 |
Conference
Conference | European Conference on Artificial Intelligence 2008 |
---|---|
Abbreviated title | ECAI 2008 |
Country/Territory | Greece |
City | Patras |
Period | 21/07/08 → 25/07/08 |