Skip to main content
SpringerLink
Log in

Extending Compact-Table to Basic Smart Tables

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming (CP 2017)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 10416))

Abstract

Table constraints are instrumental in modelling combinatorial problems with Constraint Programming. Recently, Compact-Table (CT) has been proposed 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 tables containing universal values (\(*\)), restrictions on values (\({\ne }v\)) bounds (\({\le }v\) or \({\ge }v\)) and sets (\({\in }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).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    We only deal with positive forms of table constraints in this paper.

  2. 2.

    For simplicity, we consider here a slightly simpler form of smart table constraints than in [21].

References

  1. Bessiere, C., Régin, J.C.: Arc consistency for general constraint networks: preliminary results. In: Proceedings of IJCAI 1997, pp. 398–404 (1997)

    Google Scholar 

  2. Bliek, C.: Wordwise algorithms and improved heuristics for solving hard constraint satisfaction problems. Technical report 12–96-R045, ERCIM (1996)

    Google Scholar 

  3. Boussemart, F., Lecoutre, C., Piette, C.: XCSP3: An integrated format for benchmarking combinatorial constrained problems. Technical report arXiv:1611.03398, CoRR (2016). http://www.xcsp.org

  4. Cheng, K., Yap, R.: An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints. Constraints 15(2), 265–304 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Demeulenaere, J., Hartert, R., Lecoutre, C., Perez, G., Perron, L., Régin, J.-C., Schaus, P.: Compact-table: efficiently filtering table constraints with reversible sparse bit-sets. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 207–223. Springer, Cham (2016). doi:10.1007/978-3-319-44953-1_14

    Chapter  Google Scholar 

  6. Dolan, E.D., Moré, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201–213 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gent, I., Jefferson, C., Miguel, I., Nightingale, P.: Data structures for generalised arc consistency for extensional constraints. In: Proceedings of AAAI 2007, pp. 191–197 (2007)

    Google Scholar 

  8. Gharbi, N., Hemery, F., Lecoutre, C., Roussel, O.: Sliced table constraints: combining compression and tabular reduction. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 120–135. Springer, Cham (2014). doi:10.1007/978-3-319-07046-9_9

    Chapter  Google Scholar 

  9. Mairy, J.B., Van Hentenryck, P., Deville, Y.: Optimal and efficient filtering algorithms for table constraints. Constraints 19(1), 77–120 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  10. Jefferson, C., Nightingale, P.: Extending simple tabular reduction with short supports. In: Proceedings of IJCAI 2013, pp. 573–579 (2013)

    Google Scholar 

  11. Katsirelos, G., Walsh, T.: A compression algorithm for large arity extensional constraints. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 379–393. Springer, Heidelberg (2007). doi:10.1007/978-3-540-74970-7_28

    Chapter  Google Scholar 

  12. Khot, S., Saket, R.: Hardness of minimizing and learning DNF expressions. In: IEEE 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, pp. 231–240. IEEE (2008)

    Google Scholar 

  13. Lecoutre, C.: STR2: optimized simple tabular reduction for table constraints. Constraints 16(4), 341–371 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lecoutre, C., Boussemart, F., Hemery, F.: Exploiting multidirectionality in coarse-grained arc consistency algorithms. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 480–494. Springer, Heidelberg (2003). doi:10.1007/978-3-540-45193-8_33

    Chapter  Google Scholar 

  15. Lecoutre, C., Hemery, F.: A study of residual supports in arc consistency. In: Proceedings of IJCAI 2007, pp. 125–130 (2007)

    Google Scholar 

  16. Lecoutre, C., Likitvivatanavong, C., Yap, R.: STR3: a path-optimal filtering algorithm for table constraints. Artif. Intell. 220, 1–27 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  17. Lecoutre, C., Szymanek, R.: Generalized arc consistency for positive table constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 284–298. Springer, Heidelberg (2006). doi:10.1007/11889205_22

    Chapter  Google Scholar 

  18. Lecoutre, C., Vion, J.: Enforcing arc consistency using bitwise operations. Constraint Program. Lett. 2, 21–35 (2008)

    Google Scholar 

  19. Lhomme, O., Régin, J.C.: A fast arc consistency algorithm for n-ary constraints. In: Proceedings of AAAI 2005, pp. 405–410 (2005)

    Google Scholar 

  20. Likitvivatanavong, C., Zhang, Y., Bowen, J., Freuder, E.: Arc consistency in MAC: a new perspective. In: Proceedings of CPAI’04 Workshop held with CP 2004, pp. 93–107 (2004)

    Google Scholar 

  21. Mairy, J.-B., Deville, Y., Lecoutre, C.: The smart table constraint. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 271–287. Springer, Cham (2015). doi:10.1007/978-3-319-18008-3_19

    Google Scholar 

  22. van Omme, N., Perron, L., Furnon, V.: or-tools user’s manual. Technical report, Google (2014). https://github.com/google/or-tools

  23. OscaR Team: OscaR: Scala in OR (2012). https://bitbucket.org/oscarlib/oscar

  24. Perez, G., Régin, J.-C.: Improving GAC-4 for table and MDD constraints. In: O’Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 606–621. Springer, Cham (2014). doi:10.1007/978-3-319-10428-7_44

    Google Scholar 

  25. Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 482–495. Springer, Heidelberg (2004). doi:10.1007/978-3-540-30201-8_36

    Chapter  Google Scholar 

  26. Prud’homme, C., Fages, J.G., Lorca, X.: Choco3 documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241 (2014)

    Google Scholar 

  27. de Saint-Marcq, V.L.C., Schaus, P., Solnon, C., Lecoutre, C.: Sparse-sets for domain implementation. In: (TRICS) Workshop on Techniques for Implementing Constraint Programming Systems (2013)

    Google Scholar 

  28. Ullmann, J.: Partition search for non-binary constraint satisfaction. Inf. Sci. 177, 3639–3678 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  29. Verhaeghe, H., Lecoutre, C., Schaus, P.: Extending compact-table to negative and short tables. In: Proceedings of AAAI 2017 (2017)

    Google Scholar 

  30. Wang, R., Xia, W., Yap, R., Li, Z.: Optimizing Simple Tabular Reduction with a bitwise representation. In: Proceedings of IJCAI 2016, pp. 787–795 (2016)

    Google Scholar 

  31. Xia, W., Yap, R.H.C.: Optimizing STR algorithms with tuple compression. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 724–732. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40627-0_53

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UCLouvain, ICTEAM, Place Sainte Barbe 2, 1348, Louvain-la-Neuve, Belgium

    Hélène Verhaeghe, Yves Deville & Pierre Schaus

  2. CRIL-CNRS UMR 8188, Université d’Artois, 62307, Lens, France

    Christophe Lecoutre

Authors
  1. Hélène Verhaeghe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christophe Lecoutre
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yves Deville
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Pierre Schaus
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hélène Verhaeghe .

Editor information

Editors and Affiliations

  1. University of Toronto, Toronto, Ontario, Canada

    J. Christopher Beck

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Verhaeghe, H., Lecoutre, C., Deville, Y., Schaus, P. (2017). Extending Compact-Table to Basic Smart Tables. In: Beck, J. (eds) Principles and Practice of Constraint Programming. CP 2017. Lecture Notes in Computer Science(), vol 10416. Springer, Cham. https://doi.org/10.1007/978-3-319-66158-2_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66158-2_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66157-5

  • Online ISBN: 978-3-319-66158-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation