If you know any other paper that should be listed here, please send me an email.
C. Lecoutre, L. Sais, S. Tabary and V. Vidal. Reasoning from Last Conflict(s) in Constraint Programming. Artificial Intelligence Journal (AIJ), 2009. (to appear)
D. Mehta, B.O.Sullivan, L. Quesada and N. Wilson. Search Space Extraction. In Proc. CP-2009, LNCS 5732, pp.608-622, 2009.
K. Stergiou. Heuristics for dynamically adapting propagation in constraint satisfaction problems. AI Communications 22 (2009) 125-141.
E. Stamatatos, K. Stergiou. Learning How to Propagate Using Random Probing. In Proc. CPAIOR-2009: 263-278.
R Shalom, M Avigal, R Unger. A Conflict Based SAW Method for Constraint Satisfaction Problems. In Proc. 2009 IEEE Congress on Evolutionary Computation (CEC-2009).
X. Zhu, Y. Zhang, Y. Li and C. Zhang. Consistency Technique of Multi-value Propagation (in Chinese). ACTA AUTOMATICA SINICA, 35 (2009) 1296-1301.
B. Jashmi and M. Mouhoub. Solving Temporal Constraint Satisfaction Problems with Heuristic based Genetic Algorithms. The 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'08), pages 525-529, Daytona Ohio, November 2008.
M. Mouhoub and A. Sukpan. Conditional and Composite Constraints with Preferences. FLAIRS 2008, Association for the Advancement of Artificial Intelligence (AAAI), pages 77-82, Coconut Groove, May 2008.
M. Mouhoub and A. Sukpan. Managing Temporal Constraints with Preferences. Spatial Cognition and Computation, Taylor & Francis, Vol.8, No.1-2, pages 131-149, 2008.
T. Balafoutis, K. Stergiou. Experimental evaluation of modern variable selection strategies in Constraint Satisfaction Problems. In Proceedings of the 15th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, Italy, 2008.
W. Naanaa. A domain decomposition algorithm for constraint satisfaction. Journal of Experimental Algorithmics. Vol.13, Article No. 1.13, 2008.
T. Balafoutis, K. Stergiou. On Conflict-driven variable ordering heuristics. In Proceedings of the ERCIM workshop on Constraint Solving and Constraint Logic Programming (CSCLP-2008).
T. Balafoutis, K. Stergiou. Exploiting Constraint Weights for Revision Ordering in Arc Consistency Algorithms. In Proceedings of the ECAI-2008 workshop on Modeling and Solving Problems with Constraints.
K. Stergiou: Heuristics for Dynamically Adapting Propagation. Proceedings of ECAI 2008: 485-489.
M. Mouhoub and A. Sukpan. Managing Conditional and Composite CSPs. Canadian Conference on Artificial Intelligence (AI'2007), pages 216-227, Montreal, 2007.
Y. Zhang, R.H.C. Yap, S. Shannon, C. Likitvivatanavong, and C. Lecoutre. Maintaining Arc Consistency with Multiple Residues. Constraint Programming Letters, 2007.
D. Mehta and M.R.C. van Dongen. Probabilistic Consistency Boosts MAC and SAC. Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI'2007).
M.R.C. van Dongen. Beyond Singleton Arc Consistency. Proceedings of the Seventeenth European Conference on Artificial Intelligence (ECAI'2006).
C. Lecoutre, L. Sais and J. Vion. Using SAT Encodings to Derive CSP Value Ordering Heuristics. The CP 2006 Workshop on the Integration of SAT and CP techniques.
Q. Yang, J. Sun, J. Zhang, C. Wang: A Hybrid Particle Swarm Optimization for Binary CSPs. International Conference on Intelligent Computing (ICIC) 2006: 39-49.
Q. Yang, J. Sun, J. Zhang, C. Wang: A Hybrid Discrete Particle Swarm Algorithm for Hard Binary CSPs. Advances in Natural Computation, Second International Conference (ICNC) 2006: 184-193.
D. Mehta and M.R.C. van Dongen. Static value ordering heuristics for constraint satisfaction problems. Proceedings of CPAI'05 workshop held with CP'05, pages 49–62, 2005.