Bibliography

[1]

Anbulagan and Adi Botea. Crossword puzzles as a constraint problem. In Fourteenth International Conference on Principles and Practice of Constraint Programming, 550–554. 2008.

[2]

Philippe Baptiste, Claude Le Pape, and Wim Nuijten. Constraint-Based Scheduling. International Series in Operations Research & Management Science. Springer-Verlag, 2001.

[3]

Nicolas Barnier and Pascal Brisset. Solving Kirkman's schoolgirl problem in a few seconds. Constraints, 10(1):7–21, 2005.

[4]

Adam Beacham, Xinguang Chen, Jonathan Sillito, and Peter van Beek. Constraint programming lessons learned from crossword puzzles. In Canadian Conference on AI, 78–87. 2001.

[5]

Nicolas Beldiceanu and Mats Carlsson. A new multi-resource cumulatives constraint with negative heights. In Eighth International Conference on Principles and Practice of Constraint Programming, 63–79. 2002.

[6]

Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey, and Thierry Petit. Global constraint catalogue: past, present and future. Constraints, 12(1):21–62, 2007.

[7]

Christian Bessiere, Emanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, and Toby Walsh. Filtering algorithms for the NValue constraint. Constraints, 11(4):271–293, 2006.

[8]

Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, and Lakhdar Sais. Boosting systematic search by weighting constraints. In Sixteenth European Conference on Artificial Intelligence, 146–150. 2004.

[9]

Coen Bron and Joep Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Commun. ACM, 16:575–577, September 1973.

[10]

F[rédéric] Cazals and C[hinmay] Karande. A note on the problem of reporting maximal cliques. Theoretical Computer Science, 407:564–568, November 2008.

[11]

Chiu Wo Choi, Warwick Harvey, Jimmy Ho-Man Lee, and Peter J. Stuckey. Finite domain bounds consistency revisited. In AI 2006: Advances in Artificial Intelligence, volume 4304 of Lecture Notes in Computer Science, pages 49–58. Springer Verlag, 2006.

[12]

Chiu Wo Choi, Martin Henz, and Ka Boon Ng. Components for state restoration in tree search. In Toby Walsh, editor, Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming, volume 2239 of Lecture Notes in Computer Science, 240–255. Paphos, Cyprus, November 2001. Springer-Verlag.

[13]

Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, and Pierre Schaus. Compact-table: efficiently filtering table constraints with reversible sparse bit-sets. In Twenty-second International Conference on Principles and Practice of Constraint Programming, 207–223. 2016.

[14]

Niklas Eén and Niklas Sörensson. An extensible SAT-solver. In Theory and Applications of Satisfiability Testing, 502–518. 2004.

[15]

Thibaut Feydy, Zoltan Somogyi, and Peter J. Stuckey. Half reification and flattening. In Proceedings of the Seventeenth International Conference on Principles and Practice of Constraint Programming, 286–301. 2011.

[16]

Michael R. Garey and David S. Johnson. Computers and Intractability. W. H. Freeman And Company, New York, NY, USA, 1979.

[17]

Ian P. Gent and Toby Walsh. From approximate to optimal solutions: constructing pruning and propagation rules. In IJCAI, 1396–1401. 1997.

[18]

Carmen Gervet. Finite Set Constraints. PhD thesis, L'Université de Franche-Comté, Besançon, France, 1995.

[19]

Matthew L. Ginsberg, Michael Frank, Michael P. Halpin, and Mark C. Torrance. Search lessons learned from crossword puzzles. In AAAI, 210–215. 1990.

[20]

Carla P. Gomes and Bart Selman. Algorithm portfolios. Artificial Intelligence, 126(1-2):43–62, 2001.

[21]

Stefano Gualandi and Michele Lombardi. A simple and effective decomposition for the multidimensional binpacking constraint. In Proceedings of the Nineteenth International Conference on Principles and Practice of Constraint Programming, 356–364. 2013.

[22]

William D. Harvey and Matthew L. Ginsberg. Limited discrepancy search. In Fourteenth International Joint Conference on Artificial Intelligence, 607–615. 1995.

[23]

Linnea Ingmar and Christian Schulte. Making compact-table compact. In John Hooker, editor, Twentyforth International Conference on Principles and Practice of Constraint Programming, volume 11008 of Lecture Notes in Computer Science, 210–218. Lille, France, August 2018. Springer-Verlag. \publink https://www.gecode.dev/publications/2018-08-30-making-compact-table-compact.html.

[24]

George Katsirelos and Fahiem Bacchus. Generalized nogoods in csps. In AAAI, 390–396. 2005.

[25]

Mikael Z. Lagerkvist and Gilles Pesant. Modeling irregular shape placement problems with regular constraints. In First Workshop on Bin Packing and Placement Constraints BPPC'08. 2008.

[26]

Mikael Z. Lagerkvist and Christian Schulte. Advisors for incremental propagation. In Christian Bessière, editor, Thirteenth International Conference on Principles and Practice of Constraint Programming, volume 4741 of Lecture Notes in Computer Science, 409–422. Providence, RI, USA, September 2007. Springer-Verlag. \publink https://www.gecode.dev/publications/2007-07-04-advisors-for-incremental-propagation.html. doi:10.1007/978-3-540-74970-7_30.

[27]

Yat Chiu Law and Jimmy H.M. Lee. Global constraints for integer and set value precedence. In Tenth International Conference on Principles and Practice of Constraint Programming, 362–376. 2004.

[28]

Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, and Vincent Vidal. Recording and minimizing nogoods from restarts. Journal on Satisfiability, Boolean Modeling and Computation, 1(3-4):147–167, 2007.

[29]

Jia Hui Liang, Vijay Ganesh, Pascal Poupart, and Krzysztof Czarnecki. Exponential recency weighted average branching heuristic for SAT solvers. In Thirtieth AAAI Conference on Artificial Intelligence, 3434–3440. 2016.

[30]

Stanley B. Lippman, Josée Lajoie, and Barbara E. Moo. \CPP Primer. Addison Wesley, fifth edition, 2013.

[31]

Michael Luby, Alistair Sinclair, and David Zuckerman. Optimal speedup of Las Vegas algorithms. Information Processing Letters, 47:173–180, 1993.

[32]

Alejandro López-Ortiz, Claude-Guy Quimper, John Tromp, and Peter van Beek. A fast and simple algorithm for bounds consistency of the alldifferent constraint. In Eighteenth International Joint Conference on Artificial Intelligence, 245–250. 2003.

[33]

Silvano Martello and Paolo Toth. Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics, 28(1):59–70, 1990.

[34]

Christopher Mears, Maria Garcia de la Banda, Bart Demoen, and Mark Wallace. Lightweight dynamic symmetry breaking. In Eighth International Workshop on Symmetry in Constraint Satisfaction Problems, SymCon'08. 2008. \publink http://www.aloul.net/symcon/Mears2-Symcon08.pdf.

[35]

Kurt Mehlhorn and Sven Thiel. Faster algorithms for bound-consistency of the sortedness and the alldifferent constraint. In Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming, 306–319. 2000.

[36]

Laurent Michel and Pascal Van Hentenryck. A decomposition-based implementation of search strategies. Transactions of Computational Logic, 5(2):351–383, 2004.

[37]

Laurent Michel and Pascal Van Hentenryck. Activity-based search for black-box constraint programming solvers. In CPAIOR, 228–243. 2012.

[38]

Ramon E. Moore. Interval Analysis. Prentice-Hall, Englewood Cliff, NJ, USA, 1966.

[39]

Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference, DAC 2001, 530–535. 2001.

[40]

Gilles Pesant. A regular language membership constraint for finite sequences of variables. In Tenth International Conference on Principles and Practice of Constraint Programming, 482–495. 2004.

[41]

Claude-Guy Quimper, Peter van Beek, Alejandro López-Ortiz, Alexander Golynski, and Sayyed Bashir Sadjad. An efficient bounds consistency algorithm for the global cardinality constraint. In Ninth International Conference on Principles and Practice of Constraint Programming, 600–614. 2003.

[42]

Raphael M. Reischuk, Christian Schulte, Peter J. Stuckey, and Guido Tack. Maintaining state in propagation solvers. In Fifteenth International Conference on Principles and Practice of Constraint Programming, 692–706. 2009. \publink https://www.gecode.dev/publications/2009-10-07-maintaining-state-in-propagation-solvers.html.

[43]

Jean-Charles Régin. Generalized arc consistency for global cardinality constraint. In AAAI/IAAI, Vol. 1, 209–215. 1996.

[44]

Jean-Charles Régin. A filtering algorithm for constraints of difference in CSPs. In Proceedings of the Twelfth National Conference on Artificial Intelligence, volume 1, 362–367. Seattle, WA, USA, 1994. AAAI Press.

[45]

Armin Scholl, Robert Klein, and Christian Jürgens. BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research, 24(7):627–645, 1997.

[46]

Christian Schulte. Comparing trailing and copying for constraint programming. In Proceedings of the 1999 International Conference on Logic Programming, 275–289. 1999.

[47]

Christian Schulte. Programming Constraint Services. Volume 2302 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 2002. URL: http://link.springer.de/link/service/series/0558/tocs/t2302.htm.

[48]

Christian Schulte and Mats Carlsson. Finite domain constraint programming systems. In Handbook of Constraint Programming, chapter 14, pages 495–526. 2006.

[49]

Christian Schulte and Peter J. Stuckey. Speeding up constraint propagation. In Tenth International Conference on Principles and Practice of Constraint Programming, 619–633. 2004.

[50]

Christian Schulte and Peter J. Stuckey. When do bounds and domain propagation lead to the same search space? Transactions on Programming Languages and Systems, 27(3):388–425, May 2005.

[51]

Christian Schulte and Peter J. Stuckey. Efficient constraint propagation engines. Transactions on Programming Languages and Systems, 31(1):2:1–2:43, December 2008. \publink https://www.gecode.dev/publications/2009-02-23-efficient-constraint-propagation-engines.html. doi:10.1145/1452044.1452046.

[52]

Christian Schulte and Guido Tack. Views and iterators for generic constraint implementations. In Recent Advances in Constraints (2005), volume 3978 of Lecture Notes in Computer Science, 118–132. Springer-Verlag, 2006. \publink https://www.gecode.dev/publications/2006-09-08-views-and-iterators-for-generic-constraint-implementations.html.

[53]

Christian Schulte and Guido Tack. Weakly monotonic propagators. In Fifteenth International Conference on Principles and Practice of Constraint Programming, 723–730. 2009. \publink https://www.gecode.dev/publications/2009-06-17-weakly-monotonic-propagators.html.

[54]

Christian Schulte and Guido Tack. View-based propagator derivation. Constraints, 18(1):75–107, January 2013. URL: http://www.ict.kth.se/~cschulte/paper.php?id=SchulteTack:Constraints:2013, doi:10.1007/s10601-012-9133-z.

[55]

Paul Shaw. Using constraint programming and local search methods to solve vehicle routing problems. In Fourth International Conference on Principles and Practice of Constraint Programming, 417–431. 1998.

[56]

Paul Shaw. A constraint for Bin Packing. In Tenth International Conference on Principles and Practice of Constraint Programming, 648–662. 2004.

[57]

Maxim Shishmarev, Christopher Mears, Guido Tack, and Maria Garcia de la Banda. Visual search tree profiling. Constraints, 21(1):77–94, 2016. URL: https://doi.org/10.1007/s10601-015-9202-1, doi:10.1007/s10601-015-9202-1.

[58]

Helmut Simonis. Kakuro as a constraint problem. In Workshop on Modeling and Reformulation. September 2008.

[59]

Barbara M. Smith, Kostas Stergiou, and Toby Walsh. Modelling the golomb ruler problem. School of Computer Studies Research Report 1999.12, University of Leeds, Leeds, UK, June 1999.

[60]

Guido Tack. Constraint Propagation - Models, Techniques, Implementation. Doctoral dissertation, Saarland University, Germany, 2009. \publink https://www.gecode.dev/publications/2009-02-24-constraint-propagation—models–techniques–implementation.html.

[61]

Nobuhisa Ueda and Tadaaki Nagao. NP-completeness results for nonogram via parsimonious reductions. Technical Report TR96-008, Dept. of Computer Science, Tokyo Institute of Technology, 1996.

[62]

Willem Jan van Hoeve, Gilles Pesant, Louis-Martin Rousseau, and Ashish Sabharwal. New filtering algorithms for combinations of among constraints. Constraints, 14(2):273–292, 2009.

[63]

Hélène Verhaeghe, Christophe Lecoutre, and Pierre Schaus. Extending compact-table to negative and short tables. In Thirty-First AAAI Conference on Artificial Intelligence, 3951–3957. 2017.

[64]

Petr Vil\'ım. Edge finding filtering algorithm for discrete cumulative resources in $O(kn\log n)$. In Fifteenth International Conference on Principles and Practice of Constraint Programming, 802–816. 2009.

[65]

Petr Vil\'ım. Max energy filtering algorithm for discrete cumulative resources. In Sixth International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 294–308. 2009.

[66]

Petr Vilím. Global Constraints in Scheduling. PhD thesis, Charles University, Prague, Czech Republic, 2007.

[67]

H.C. von Warnsdorff. Des Rösselsprungs einfachste und allgemeinste Lösung. 1823. Schmalkalden, Germany.

[68]

Mark Allen Weiss. \CPP for Java Programmers. Pearson Prentice Hall, 2004.

[69]

Peter van Beek. Backtracking search algorithms. In Handbook of Constraint Programming, chapter 4, pages 85–134. 2006.

[70]

Pascal Van Hentenryck. Constraint satisfaction in logic programming. The MIT Press, Cambridge, MA, USA, 1989.

[71]

Pascal Van Hentenryck. The OPL Optimization Programming Language. The MIT Press, Cambridge, MA, USA, 1999.