Extending Compact-Table to Negative and Short Tables

Hélène Verhaeghe, Christophe Lecoutre, Pierre Schaus

AAAI 2017 pp. 3951-3957

doi:10.1609/AAAI.V31I1.11127 /aaai/2017/verhaeghe2017aaai-extending/

Abstract

Table constraints are very useful for modeling combinatorial 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 constraints. A state-of-the art GAC algorithm called Compact-Table (CT), which has been recently proposed, significantly outperforms all previously proposed algorithms. In this paper, we extend this algorithm in order to deal with both short supports and negative tables, i.e., tables that contain universal values and conflicts. Our experimental results show the interest of using this fast general algorithm.

PDF AAAI Semantic Scholar

Cite

Text

Verhaeghe et al. "Extending Compact-Table to Negative and Short Tables." AAAI Conference on Artificial Intelligence, 2017. doi:10.1609/AAAI.V31I1.11127

Markdown

[Verhaeghe et al. "Extending Compact-Table to Negative and Short Tables." AAAI Conference on Artificial Intelligence, 2017.](https://mlanthology.org/aaai/2017/verhaeghe2017aaai-extending/) doi:10.1609/AAAI.V31I1.11127

BibTeX

@inproceedings{verhaeghe2017aaai-extending,
  title     = {{Extending Compact-Table to Negative and Short Tables}},
  author    = {Verhaeghe, Hélène and Lecoutre, Christophe and Schaus, Pierre},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2017},
  pages     = {3951-3957},
  doi       = {10.1609/AAAI.V31I1.11127},
  url       = {https://mlanthology.org/aaai/2017/verhaeghe2017aaai-extending/}
}