Extending Compact-Table to Basic Smart Tables

Verhaeghe, Hélène;Lecoutre, Christophe;Deville, Yves;Schaus, Pierre;et.al.
(2017) 23rd International Conference on Principles and Practice of Constraint Programming (CP17) — Location: Melbourne, Australia (28.August.2017)

Files

112_verhaeghe.pdf
  • Open Access
  • Adobe PDF
  • 495.63 KB
Download

Details

Authors
Abstract
Table constraints are instrumental in modelling combinatorial prob- lems with Constraint Programming. Recently, Compact-Table (CT) has been pro- posed and shown to be as an efficient filtering algorithm for table constraints, notably because of bitwise operations. CT has already been extended to handle non-ordinary tables, namely, short tables and/or negative tables. In this paper, we introduce another extension so as to deal with basic smart tables, which are ta- bles containing universal values (∗), restrictions on values (6 = v) bounds (≤ v or ≥ v) and sets (∈ S). Such tables offer the user a better expressiveness and permit to deal efficiently with compressed tuples. Our experiments show a substantial speedup when compression is possible (and a very limited overhead otherwise).
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Verhaeghe, H., Lecoutre, C., Deville, Y., Schaus, P., & et al. (2017). Extending Compact-Table to Basic Smart Tables. Principles and Practice of Constraint Programming, p. 297-307. https://hdl.handle.net/2078.5/269964