Extending Compact-Table to Negative and Short Tables
(2017) The Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17) — Location: San Francisco, USA (4.February.2017)
Files
verhaeghe.pdf
Open Access - Adobe PDF
- 393.72 KB
Details
- Authors
- Abstract
- Table constraints are very useful for modeling combinato- rial constrained problems, and thus play an important role in Constraint Programming (CP). During the last decade, many algorithms have been proposed for enforcing the property known as Generalized Arc Consistency (GAC) on such con- straints. A state-of-the art GAC algorithm called Compact- Table (CT), which has been recently proposed, significantly outperforms all previously proposed algorithms. In this pa- per, we extend this algorithm in order to deal with both short supports and negative tables, i.e., tables that contain univer- sal values and conflicts. Our experimental results show the interest of using this fast general algorithm.
- Affiliations
Citations
Verhaeghe, H., Lecoutre, C., & Schaus, P. (2017). Extending Compact-Table to Negative and Short Tables. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence and the Twenty-Ninth Innovative Applications of Artificial Intelligence Conference, 5. https://hdl.handle.net/2078.5/255529 (Original work published 2017)