User menu

Optimal and efficient filtering algorithms for table constraints

Bibliographic reference Mairy, Jean-Baptiste ; van Hentenryck, Pascal ; Deville, Yves. Optimal and efficient filtering algorithms for table constraints. In: Constraints : an international journal, Vol. 19, no.1, p. 77-120 (2014)
Permanent URL http://hdl.handle.net/2078.1/140945
  1. van Beek, P. (2006). Backtracking search algorithm. In Rossi, F., Beek, P.v., Walsh, T. (Eds.), Handbook of Constraint Programming (Foundations of Artificial Intelligence). New York: Elsevier Science Inc.
  2. Beldiceanu Nicolas, Carlsson Mats, Debruyne Romuald, Petit Thierry, Reformulation of Global Constraints Based on Constraints Checkers, 10.1007/s10601-005-2809-x
  3. Bessière, C. (2006). Constraint propagation. In Rossi, F., Beek, P.v., Walsh, T. (Eds.), Handbook of Constraint Programming (Foundations of Artificial Intelligence). New York: Elsevier Science Inc.
  4. Bessière, C., & Régin, J. C. (1997). Arc consistency for general constraint networks: preliminary results. IJCAI, (1), 398–404.
  5. Briggs Preston, Torczon Linda, An efficient representation for sparse sets, 10.1145/176454.176484
  6. Carlsson, M. (2006). Filtering for the case constraint, talk given at the advanced school on global constraints.
  7. Cheng Kenil C. K., Yap Roland H. C., An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints, 10.1007/s10601-009-9087-y
  8. Deville, Y., & Van Hentenryck, P. (2010). Domain consistency with forbidden values. In Proceedings of CP 2010, pp. 191–205. Springer.
  9. Fleming Philip J., Wallace John J., How not to lie with statistics: the correct way to summarize benchmark results, 10.1145/5666.5673
  10. Gange Graeme, Stuckey Peter J., Szymanek Radoslaw, MDD propagators with explanation, 10.1007/s10601-011-9111-x
  11. Gent, I. P., Jefferson, C., Miguel, I. (2006). Watched literals for constraint propagation in Minion. In Proceedings of CP 2006 (pp. 182–197). Springer-Verlag.
  12. Gent, I. P., Jefferson, C., Miguel, I., Nightingale, P. (2007). Data structures for generalised arc consistency for extensional constraints. In Proceedings of the AAAI 07 (pp. 191–197). AAAI Press.
  13. Katsirelos, G., & Walsh, T. (2007). A compression algorithm for large arity extensional constraints. In Proceedings of CP 2007 (pp. 379–393). Springer-Verlag.
  14. Lecoutre, C. Instances of the Constraint Solver Competition. http://www.cril.fr/~lecoutre/ .
  15. Lecoutre, C. (2009). Constraint Networks: Techniques and Algorithms. ISTE/Wiley.
  16. Lecoutre Christophe, STR2: optimized simple tabular reduction for table constraints, 10.1007/s10601-011-9107-6
  17. Lecoutre, C., & Szymanek, R. (2006). Generalized arc consistency for positive table constraints. In Proceedings of CP 2006 (pp. 284–298).
  18. Lecoutre, C., Hemery, F., etal (2007). A study of residual supports in arc consistency. In Proceedings of IJCAI 2007 (vol.7, pp. 125–130).
  19. Lecoutre, C., Likitvivatanavong, C., Yap, R. (2012). A path-optimal gac algorithm for table constraints. In Proceedings of ECAI 2012 (pp. 510–515).
  20. Lhomme, O. (2004). Arc-consistency filtering algorithms for logical combinations of constraints. In Proceedings of CPAIOR 2004 (pp. 209–224).
  21. Lhomme, O., & Régin, J. C. (2005). A fast arc consistency algorithm for n-ary constraints. In Proceedings of the nationnal conference on artificial intelligence (pp. 405–410). AAAI Press.
  22. Mairy, J. B., Van Hentenryck, P., Deville, Y. (2012). An optimal filtering algorithm for table constraints. In Proceedings of CP 2012 (vol. 3709, pp. 496–511). Springer: Berlin.
  23. Mohr, R., & Masini, G. (1988). Good old discrete relaxation. In Proceedings of ECAI 1988 (pp. 651–656).
  24. Perron, L., & Furnon, V. or-tools. http://code.google.com/p/or-tools .
  25. Pesant, G. (2004). A regular language membership constraint for finite sequences of variables. In Proceedings of CP 2004 (pp. 482–495). Springer.
  26. Quimper, C. G., & Walsh, T. (2006). Global grammar constraints. In Proceedings of CP 2006 (pp. 751–755). Springer.
  27. Régin, J. C. (2011). Improving the expressiveness of table constraints. In Proceedings of ModRef 2011, Workshop held with CP 2011.
  28. Samaras, N., & Stergiou, K. (2005). Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results. Journal of Artificial Intelligence Research, 24(1), 641–684.
  29. Ullmann Julian R., Partition search for non-binary constraint satisfaction, 10.1016/j.ins.2007.03.030
  30. Van Hentenryck Pascal, Ramachandran Viswanath, Backtracking without trailing in CLP (RLin), 10.1145/210184.210192
  31. Van Hentenryck Pascal, Deville Yves, Teng Choh-Man, A generic arc-consistency algorithm and its specializations, 10.1016/0004-3702(92)90020-x
  32. Wallace, R. (2005). Factor analytic studies of csp heuristics. In Proceedings of CP 2005 (vol. 3709, pp. 712–726). Springer: Berlin / Heidelberg.
  33. Xu Ke, Boussemart Frédéric, Hemery Fred, Lecoutre Christophe, Random constraint satisfaction: Easy generation of hard (satisfiable) instances, 10.1016/j.artint.2007.04.001