[. Bibliography and . Amaldi, Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs, Integer Programming and Combinatorial Optimization, vol.6080, pp.397-410, 2010.

[. Balafrej, Amine Balafrej, Christian Bessiere, El-Houssine Bouyakhf, and Gilles Trombettoni, Proceedings of 19 th International Conference on Principle and Practice of Constraint Programming (CP'13), vol.8124, pp.2601-2607, 2013.

, Multi-Armed Bandits for Adaptive Constraint Propagation, Proceedings of the 24 th International Joint Conference on Artificial Intelligence, pp.290-296, 2015.

. Baptiste, Handbook of Constraint Programming, chapter Constraint-Based Scheduling and Planning, p.235, 2006.

. Bayardo, J. Mirankar-;-roberto, D. P. Bayardo, and . Mirankar, A Complexity Analysis of Space-Bound Learning Algorithms for the Constraint Satisfaction Problem, Proceedings of the Thirteen National Conference on Artificial Intelligence (AAAI 1996), pp.298-304, 1996.

[. Bayer, An Interactive Constraint-Based Approach to Minesweeper, Proceedings of AAAI-2006, pp.1933-1934, 2006.

A. Bennaceur, Hachemi Bennaceur and Mohamed-Salah Affane. Partition-k-AC: An Efficient Filtering Technique Combining Domain Partition and Arc Consistency, Proceedings of 7 th International Conference on Principle and Practice of Constraint Programming, vol.2239, p.560, 2001.

. Springer, , 2001.

C. Bessière and J. Régin, MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems, Proceedings of 2 nd International Conference on Principle and Practice of, 1996.

. Bessière, An Optimal Coarse-Grained Arc Consistency Algorithm, Constraint Programming (CP'96), vol.165, pp.165-185, 1996.

[. Bessière, Domain Filtering Consistencies for Non-Binary Constraints, Artificial Intelligence, vol.172, pp.800-822, 2008.

, Handbook of Constraint Programming, chapter Constraint Propagation, pp.29-83, 2006.

R. Bitner, R. Bitner, and E. M. Reingold, Backtrack Programming Techniques, Communications of the ACM, vol.18, issue.11, pp.651-656, 1975.

S. Bliek, D. Bliek, ;. Sam-haroud, and . Borrett, Path Consistency for Triangulated Constraint Graphs, Proceedings of the 16 th International Joint Conference on Artificial Intelligence, pp.456-461, 1996.

. Boussemart, Some Design Issues in the Visualization of Constraint Logic Program Execution, Analysis and Visualization Tools for Constraint Programming: Constraint Debugging, vol.1870, pp.253-272, 1996.

A. David, P. G. Cohen, and . Jeavons, The Power of Propagation: when GAC is Enough, Constraints, vol.22, issue.1, pp.3-23, 2017.

. Darwiche, Adnan Darwiche. Recursive Conditioning. Artificial Intelligence, vol.126, issue.1-2, pp.5-41, 2001.

P. Davis, H. Davis, and . Putnam, A Computing Procedure for Quantification Theory, J. ACM, vol.7, issue.3, pp.201-215, 1960.

R. Debruyne, C. Bessière, R. Dechter, and R. Mateescu, Debruyne and Bessière, 1997b ] Romuald Debruyne and Christian Bessière. Some Practicable Filtering Techniques for the Constraint Satisfaction Problem, Proceedings of 10 th International Conference on Principle and Practice of Constraint Programming (CP'04), vol.3258, p.238, 1997.

R. Dechter and J. Pearl, Dechter and Pearl, 1989 ] Rina Dechter and Judea Pearl. Tree Clustering for Constraint Networks, Constraint Processing, vol.34, pp.353-366, 1988.

. Dechter-;-demeulenaere, Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets, Proceedings of 22 nd International Conference on Principle and Practice of Constraint Programming (CP'16), vol.9892, pp.207-223, 2004.

A. Biere-;-niklas-eén and . Biere, Effective Preprocessing in SAT Through Variable and Clause Elimination, Proceedings of Theory and Applications of Satisfiability Testing: 8th International Conference (SAT 2005), vol.3569, pp.61-75, 2005.

. Epstein, The Adaptive Constraint Engine, Proceedings of 8 th International Conference on Principle and Practice of Constraint Programming, vol.2470, pp.1-15, 2002.

[. Favier, Exploiting Problem Structure for Solution Counting, Proceedings of the International Conference on Principles and Practice of Constraint Programming, vol.5732, pp.335-343, 2009.

. Freuder, C. Elfe-;-eugene, C. D. Freuder, and . Elfe, Neighborhood Inverse Consistency Preprocessing, Proceedings of AAAI-96, pp.202-208, 1996.

E. C. Freuder and M. J. Quinn, The Use of Lineal Spanning Trees to Represent Constraint Satisfaction Problems, 1987.

. Freuder, C. Wallace-;-eugene, R. J. Freuder, and . Wallace, Selective Relaxation For Constraint Satisfaction Problems, Proceedings of the IEEE 3 rd International Conference on Tools with Artificial Intelligence, vol.29, pp.24-32, 1982.

G. R. Fulkerson, O. A. Fulkerson, . Gross, and . Geschwender, Incidence Matrices and Interval Graphs, Pacific Journal of Mathematics, vol.15, issue.3, pp.835-855, 1965.

. Geschwender, Pre-PhD Student Abstract and Poster Program, Proceedings of the 27 th Conference on Artificial Intelligence (AAAI 2013), pp.1611-1612, 2013.

S. D. Choueiry, C. Scott-;-martin, and . Golumbic, A Portfolio Approach for Enforcing Minimality in a Tree Decomposition, Doctoral Program of the International Conference on Principles and Practice of Constraint Programming (CP 2016), vol.5202, pp.534-538, 1980.

[. Gottlob, A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence, vol.124, issue.2, pp.243-282, 2000.

;. M. Gyssens and . Gyssens, On the Complexity of Join Dependencies. ACM Trans. Database Systems, vol.11, issue.1, pp.81-108, 1986.

E. Haralick, M. Robert, G. L. Haralick, and . Elliott, Increasing Tree Search Efficiency for Constraint Satisfaction Problems, Artificial Intelligence, vol.14, pp.263-313, 1980.

[. Hentenryck, A Generic Arc Consistency Algorithm and its Specializations, Artificial Intelligence, vol.57, pp.291-321, 1992.

J. D. Horton, ;. Horton, and . Howell, A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph, Proceedings of the 27 th International Joint Conference on Artificial Intelligence, vol.16, pp.5829-5831, 1987.

. Howell, A Filtering Process for General Constraint-Satisfaction Problems: Achieving Pairwise-Consistency Using an Associated Binary Representation, Proceedings of the 2 nd Workshop on Explainable Artificial Intelligence, pp.420-427, 1989.

[. Järvisalo, Inprocessing Rules, Automated Reasoning: 6th International Joint Conference (IJCAR 2012, vol.7364, pp.355-370, 2012.

. Jeavons, A Structural Decomposition for Hypergraphs, Contemporary Mathematics, vol.178, p.242, 1994.

P. Jégou and C. Terrioux, Hybrid Backtracking Bounded by Tree-Decomposition of Constraint Networks, Artificial Intelligence, vol.146, pp.43-75, 2003.

J. Jégou, On the Consistency of General Constraint-Satisfaction Problems, AAAI 1993, pp.114-119, 1993.

[. Kadioglu, A First Practical Algorithm for High Levels of Relational Consistency, Proceedings of 17 th International Conference on Principle and Practice of Constraint Programming (CP'11), vol.6876, pp.101-107, 2010.

[. Karakashian, , 2013.

. Choueiry, Improving the Performance of Consistency Algorithms by Localizing and Bolstering Propagation in a Tree Decomposition, Proceedings of AAAI-2013, pp.466-473, 2013.

[. Kavitha, Kjaerulff. Triagulation of Graphs -Algorithms Giving Small Total State Space, Symposium on Theoretical Aspects of Computer Science (STACS 2007, vol.4393, p.243, 1990.

[. Lecoutre, Christophe Lecoutre, Stéphane Cardon, and Julien Vion. Conservative Dual Consistency, Proceedings of AAAI-2007, vol.40, pp.175-219, 2007.

[. Lecoutre, A Path-Optimal GAC Algorithm for Table Constraints, Proc. of ECAI 2012, pp.510-515, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00873051

[. Lecoutre, Christophe Lecoutre, Anastasia Paparrizou, and Kostas Stergiou. Extending STR to a Higher-Order Consistency, Proceedings of AAAI-2013, pp.576-582, 2013.

C. Lecoutre and . Lecoutre, Constraint Networks: Techniques and Algorithms, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00870016

C. Lecoutre and . Lecoutre, STR2: Optimized Simple Tabular Reduction for Table Constraints, Constraints, vol.16, issue.4, pp.341-371, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00868225

[. Lim, An Interactive System for Hiring and Managing Graduate Teaching Assistants, Conference on Prestigious Applications of Intelligent Systems (ECAI 04), pp.730-734, 2004.

A. K. Mackworth and . Mackworth, Consistency in Networks of Relations. Artificial Intelligence, vol.8, pp.99-118, 1977.

R. Marinescu and R. Dechter, Memory Intensive Branch-and-Bound Search for Graphical Models, Proceedings of the TwentyFirst National Conference on Artificial Intelligence (AAAI 2006), pp.1200-1205, 2006.

, Minimum Cycle Bases: Faster and Simpler, ACM Trans. Algorithms, vol.6, issue.1, pp.1-13, 2009.

V. Michel, ;. Hentenryck, P. Michel, and . Van-hentenryck, Activity-Based Search for Black-Box Constraint Programming Solvers, Proc. of CPAIOR 2012, vol.7298, pp.228-243, 2012.

M. Mohr, G. Mohr, and . Masini, Good Old Discrete Relaxation, Proceedings of the Eigthth European Conference on Artificial Intelligence, pp.651-656, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00548479

. Montanari, Networks of Constraints: Fundamental Properties and Application to Picture Processing, Nadel. Constraint Satisfaction Algorithms. Computational Intelligence, vol.7, pp.188-224, 1974.

[. Ostrowski, Recovering and Exploiting Structural Knowledge from CNF Formulas, Proceedings of 8 th International Conference on Principle and Practice of, 2002.

, Otten and Dechter, 2012 ] Lars Otten and Rina Dechter. Anytime AND/OR Depthfirst Search for Combinatorial Optimization, Constraint Programming (CP'02), volume 2470 of LNCS, vol.25, p.245, 2002.

[. Palmieri, Parallel Strategies Selection, Proceedings of 22 nd International Conference on, 2016.
URL : https://hal.archives-ouvertes.fr/hal-02133495

A. Paparrizou and K. Stergiou, Evaluating Simple Fully Automated Heuristics for Adaptive Constraint Propagation, Anastasia Paparrizou and Kostas Stergiou. Strong Local Consistency Algorithms for Table Constraints, vol.9892, pp.163-197, 2012.

A. Paparrizou and K. Stergiou, On Neighborhood Singleton Consistencies, Proceedings of the 26 th International, 2017.

, Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems, Joint Conference on Artificial Intelligence, vol.43, pp.173-210, 2012.

[. Planken, P 3 C: A New Algorithm for the Simple Temporal Problem, Proceedings of the 18th International Conference on Automated Planning & Scheduling (ICAPS 2008), pp.256-263, 2008.

P. Prosser and . Prosser, Hybrid Algorithms for the Constraint Satisfaction Problem, Computational Intelligence, vol.9, issue.3, p.246, 1993.

. Reeson, On Path Consistency for Binary Constraint Satisfaction Problems, Proceedings of 10 th International Conference on Principle and Practice of Constraint Programming, vol.3258, pp.557-571, 2007.

. Springer, , 2004.

I. Rish and R. Dechter, Resolution versus Search: Two Strategies for SAT, Journal of Automated Reasoning, vol.24, issue.1, pp.225-275, 2000.

[. Rossi, On the Equivalence of Constraint Satisfaction Problems, Proceedings of the Ninth European Conference on Artificial Intelligence, pp.550-556, 1990.

[. Rossi, Constraint Programming, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00160403

. Schulte, Guido Tack, and Mikael Z. Lagerkvist. Modeling and Programming with Gecode, 2015.

. Schulte-;-christian and . Schulte, Oz Explorer: A Visual Constraint Programming Tool, International Symposium on Programming Language Implementation and Logic Programming, pp.477-478, 1996.

R. Seidel and . Seidel, A New Method for Solving Constraint Satisfaction Problems, Proceedings of the Seventh International Joint Conference on Artificial Intelligence, pp.338-342, 1981.

[. Shishmarev, , 2016.

M. Garcia-de-la-banda, ;. Simonis, O. Simonis, O. Barry, and . Sullivan, Helmut Simonis and Abder Aggoun, Analysis and Visualization Tools for Constraint Programming: Constraint Debugging, vol.21, pp.191-208, 2000.

, Artificial Intelligence, and Operations Research Principle and Practice of Constraint Programming, Constraint Programming, vol.6697, p.196, 2011.

. Springer, , 2011.

. Simonis, Complex Constraint Abstraction: Global Constraint Visualisation, Analysis and Visualization Tools for Constraint Programming: Constraint Debugging, vol.1870, pp.299-317, 2000.

. Simonis, A Generic Visualization Platform for CP, Proceedings of 16 th International Conference on Principle and Practice of Constraint Programming (CP'10), vol.6308, p.248, 2010.

S. Subbarayan and D. K. Pradhan, NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances, Theory and Applications of Satisfiability Testing: 7th International Conference (SAT 2004), vol.3542, pp.276-291, 2005.

. Freuder, A Reformulation Strategy for Multi-Dimensional CSPs: The Case Study of the Set Game, Ninth International Symposium on Abstraction, Reformulation and Approximation, pp.107-116, 2011.

M. Robert-endre-tarjan and . Yannakakis, Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs, SIAM Journal on Computing, vol.13, issue.3, pp.566-579, 1984.

. Tsang, Edward Tsang. Foundations of Constraint Satisfaction, 1993.

J. R. Ullmann and . Ullmann, Partition Search for Non-binary Constraint Satisfaction, Information Sciences, vol.177, issue.18, pp.3639-3678, 2007.

L. G. Valiant, The Complexity of Computing the Permanent, Theoretical Computer Science, vol.8, pp.189-201, 1979.

[. Vion, Integrating Strong Local Consistencies into Constraint Solvers, 14th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, vol.6080, pp.90-104, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00869092

. Wallace, J. Freuder-;-richard, E. C. Wallace, and . Freuder, Ordering Heuristics for Arc Consistency Algorithms, AI/GI/VI 92, vol.28, pp.345-364, 1992.

T. Walsh, Search in a Small World, Proceedings of the 16 th International Joint Conference on Artificial Intelligence, vol.1, pp.80-83, 1945.

J. Robert, B. Y. Woodward, and . Choueiry, Weight-Based Variable Ordering in the Context of High-Level Consistencies, 2017.

[. Woodward, , 2011.

C. Choueiry and . Bessiere, Adaptive Neighborhood Inverse Consistency as Lookahead for Non-Binary CSPs, Proceedings of AAAI-2011, pp.1830-1831, 2011.

[. Woodward, , 2011.

C. Choueiry and . Bessiere, Solving Difficult CSPs with Relational Neighborhood Inverse Consistency, Proceedings of AAAI-2011, pp.112-119, 2011.

[. Woodward, , 2011.

C. Choueiry and . Bessiere, Reformulating the Dual Graphs of CSPs to Improve the Performance of Relational Neighborhood Inverse Consistency, Ninth International Symposium on Abstraction, Reformulation and Approximation, pp.140-148, 2011.

[. Woodward, , 2012.

C. Choueiry, ;. Bessiere, and . Woodward, Revisiting Neighborhood Inverse Consistency on Binary CSPs, Proceedings of 18 th International Conference on Principle and Practice of Constraint Programming, vol.7514, pp.688-703, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00748179

C. Choueiry, ;. Bessiere, and . Woodward, Adaptive Parameterized Consistency for NonBinary CSPs by Counting Supports, Proceedings of 20 th International Conference on Principle and Practice of Constraint Programming (CP'14), vol.8656, pp.755-764, 2014.
URL : https://hal.archives-ouvertes.fr/lirmm-01067342

[. Woodward, , 2016.

C. Choueiry and . Bessiere, Witnessing Solution Counting in Tree-Structured Methods for CSPs, 2016.

[. Woodward, Cycle-Based Singleton Local Consistencies, Proceedings of AAAI-2017, pp.5005-5006, 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-01711585

[. Woodward, Andreas Wotzlaw, Alexander van der Grinten, and Ewald Speckenmeyer. Effectiveness of pre-and inprocessing for CDCL-based SAT solving, Proceedings of the 27 th International Joint Conference on Artificial Intelligence, pp.1390-1397, 2013.

C. Xu, B. Y. Xu, and . Choueiry, A New Efficient Algorithm for Solving the Simple Temporal Problem, 10th International Symposium on Temporal Representation and Reasoning and Fourth International Conference on Temporal Logic (TIME-ICTL 03), pp.212-222, 2003.

. Xu, Pierre-Alain Yvars. Using Constraint Satisfaction for Designing Mechanical Systems, International Journal on Interactive Design and Manufcturing (IJIDeM), vol.32, issue.3, pp.161-167, 2008.