Research activities

Keywords: (valued) constraint satisfaction problem, optimization, counting, structural methods, tree-decomposition, tractable classes, applications

Some selected publications

P. Jégou and C. Terrioux. Hybrid backtracking bounded by tree-decomposition of constraint networks.
In Artificial Intelligence, 146, pages 43-75, 2003. doi
P. Jégou and C. Terrioux. Decomposition and Good Recording.
In Proceedings of the 16th European Conference on Artificial Intelligence (ECAI), pages 196-200, 2004.
M. Cooper, A. El Mouelhi, C. Terrioux and B. Zanuttini. On Broken Triangles.
In Proceedings of the 20th International Conference on Principles and Practice of Constraint Programming (CP), pages 9-24, 2014. (best technical paper) doi
A. El Mouelhi, P. Jégou and C. Terrioux. A Hybrid Tractable Class for Non-Binary CSPs.
In Constraints, 20 (4), pages 383-413, 2015. doi
M. Cooper, A. Duchein, A. El Mouelhi, G. Escamocher, C. Terrioux and B. Zanuttini. From Value Merging to a Tractable Class of General-Arity Constraint Satisfaction Problems.
In Artificial Intelligence, 234, pages 196-218, 2016. doi
P. Jégou and C. Terrioux. Combining Restarts, Nogoods and Bag-Connected Decompositions for Solving CSPs.
In Constraints, 22(2), pages 191-229, 2017. doi
M. Cooper, A. El Mouelhi and C. Terrioux. Variable elimination in binary CSPs.
In Journal of Artificial Intelligence Research, 66, pages 589-624, 2019. doi
D. Habet and C. Terrioux. Conflict History Based Heuristic for Constraint Satisfaction Problem Solving.
In Journal of Heuristics, 27(6), pages 951-990, 2021. doi
Y. Carissan, D. Hagebaum-Reignier, N. Prcovic, C. Terrioux and A. Varet. How constraint programming can help chemists to generate Benzenoid structures and assess the local Aromaticity of Benzenoids.
In Constraints, 27(3), pages 192-248, 2022. doi

+ List of publications by type

International Journals (9)

N. Adrar, P. Jégou and C. Terrioux. Computing partial hypergraphs of bounded width.
In Discrete Applied Mathematics, 329, pages 1-22, 2023. doi
Y. Carissan, D. Hagebaum-Reignier, N. Prcovic, C. Terrioux and A. Varet. How constraint programming can help chemists to generate Benzenoid structures and assess the local Aromaticity of Benzenoids.
In Constraints, 27(3), pages 192-248, 2022. doi
A. Varet, N. Prcovic, C. Terrioux, D. Hagebaum-Reignier and Y. Carissan. BenzAI: A Program to Design Benzenoids with Defined Properties Using Constraint Programming.
In Journal of Chemical Information and Modeling, 62(11), pages 2811-2820, 2022. doi
D. Habet and C. Terrioux. Conflict History Based Heuristic for Constraint Satisfaction Problem Solving.
In Journal of Heuristics, 27(6), pages 951-990, 2021. doi
M. Cooper, A. El Mouelhi and C. Terrioux. Variable elimination in binary CSPs.
In Journal of Artificial Intelligence Research, 66, pages 589-624, 2019. doi
P. Jégou and C. Terrioux. Combining Restarts, Nogoods and Bag-Connected Decompositions for Solving CSPs.
In Constraints, 22(2), pages 191-229, 2017. doi
M. Cooper, A. Duchein, A. El Mouelhi, G. Escamocher, C. Terrioux and B. Zanuttini. From Value Merging to a Tractable Class of General-Arity Constraint Satisfaction Problems.
In Artificial Intelligence, 234, pages 196-218, 2016. doi
A. El Mouelhi, P. Jégou and C. Terrioux. A Hybrid Tractable Class for Non-Binary CSPs.
In Constraints, 20 (4), pages 383-413, 2015. doi
P. Jégou and C. Terrioux. Hybrid backtracking bounded by tree-decomposition of constraint networks.
In Artificial Intelligence, 146, pages 43-75, 2003. doi

National Journal (1)

P. Jégou and C. Terrioux. Recherche arborescente bornée pour la résolution de CSP valués.
In Journal électronique d’intelligence artificielle (JEDAI), 3(28), 2004. (in french)

Book Chapters (3)

A. El Mouelhi, P. Jégou and C. Terrioux. Different Classes of Graphs to Represent Microstructures for CSPs.
Graph Structures for Knowledge Representation and Reasoning, LNAI 8323, pages 21-38, 2014. doi
P. Jégou and C. Terrioux. Structural Consistency: A New Filtering Approach for Constraint Networks.
Graph Structures for Knowledge Representation and Reasoning, LNAI 8323, pages 74-91, 2014. doi
P. Jégou, S. N. Ndiaye and C. Terrioux. Dynamic heuristics for Branch and Bound search on Tree-decomposition of Weighted CSPs.
Trends in Constraint Programming, ISTE (Ed.), chapter 20, pages 317-332, 2007.

International Conferences (42)

D. Habet, Y. El Ghazi and C. Terrioux. A CP Approach for the Liner Shipping Network Design Problem.
In Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, pages 16:1-16:21, 2023. doi
Y. Carissan, D. Hagebaum-Reignier, N. Prcovic, C. Terrioux and A. Varet. Exhaustive Generation of Benzenoid Structures Sharing Common Patterns.
In Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), pages 19:1-19:18, 2021.
M. S. Cherif, D. Habet and C. Terrioux. Combining VSIDS and CHB Using Restarts in SAT.
In Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), pages 20:1-20-19, 2021.
Y. Carissan, C. Dim, D. Hagebaum-Reignier, N. Prcovic, C. Terrioux and A. Varet. Computing the Local Aromaticity of Benzenoids Thanks to Constraint Programming.
In Proceedings of the 26th International Conference on Principles and Practice of Constraint Programming, pages 673-689, 2020. doi
Y. Carissan, D. Hagebaum-Reignier, N. Prcovic, C. Terrioux and A. Varet. Using Constraint Programming to Generate Benzenoid Structures in Theoretical Chemistry.
In Proceedings of the 26th International Conference on Principles and Practice of Constraint Programming, pages 690-706, 2020. doi
M. S. Cherif, D. Habet and C. Terrioux. On the Refinement of Conflict History Search Through Multi-Armed Bandit.
In Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 264-271, 2020. doi
M. Cooper, A. El Mouelhi and C. Terrioux. Variable Elimination in Binary CSPs (Extended Abstract).
In Proceedings of the Twenty-Ninth International Joint Conference on Artificial (IJCAI), Intelligence Journal track, pages 5035-5039, 2020. doi
D. Habet and C. Terrioux. Conflict History based Search for Constraint Satisfaction Problem.
In Proceedings of the 34th ACM/SIGAPP Symposium On Applied Computing (SAC), Knowledge Representation and Reasoning Track, pages 1117–1122, 2019. doi
P. Jégou, H. Kanso and C. Terrioux. On the Relevance of Optimal Tree Decompositions for Constraint Networks.
In Proceedings of the 30th International Conference on Tools with Artificial Intelligence (ICTAI), pages 738-743, 2018. doi
P. Jégou, H. Kanso and C. Terrioux. Adaptive and Opportunistic Exploitation of Tree-Decompositions for Weighted CSPs..
In Proceedings of the 29th International Conference on Tools with Artificial Intelligence (ICTAI), pages 366-373, 2017. doi
M. Cooper, A. El Mouelhi and C. Terrioux. Extending Broken Triangles and Enhanced Value-merging.
In Proceedings of the 22nd International Conference on Principles and Practice of Constraint Programming (CP), pages 173-188, 2016. doi
P. Jégou, H. Kanso and C. Terrioux. Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size.
In Proceedings of the 22nd International Conference on Principles and Practice of Constraint Programming (CP), pages 298-315, 2016. doi
P. Jégou, H. Kanso and C. Terrioux. Improving Exact Solution Counting for Decomposition Methods.
In Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 327-334, 2016. doi
M. Cooper, A. El Mouelhi, C. Terrioux, B. Zanuttini and P. Jégou. On Broken Triangles.
In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), pages 4135-4139, 2016. (Sister Conference Best Paper Track)
P. Jégou and C. Terrioux. The Extendable-Triple Property: a new CSP Tractable Class beyond BTP.
In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI), pages 3746-3754, 2015.
M. Cooper, P. Jégou and C. Terrioux. A Microstructure-based Family of Tractable Classes for CSPs.
In Proceedings of the 21st International Conference on Principles and Practice of Constraint Programming (CP), pages 74-88, 2015. doi
P. Jégou, H. Kanso and C. Terrioux. An Algorithmic Framework for Decomposing Constraint Networks.
In Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 1-8, 2015. doi
M. Cooper, A. El Mouelhi, C. Terrioux and B. Zanuttini. On Broken Triangles.
In Proceedings of the 20th International Conference on Principles and Practice of Constraint Programming (CP), pages 9-24, 2014. (best technical paper) doi
P. Jégou and C. Terrioux. Tree-Decompositions with Connected Clusters for Solving Constraint Networks.
In Proceedings of the 20th International Conference on Principles and Practice of Constraint Programming (CP), pages 407-423, 2014. doi
P. Jégou and C. Terrioux. Combining Restarts, Nogoods and Decompositions for Solving CSPs.
In Proceedings of the 21st European Conference on Artifcial Intelligence (ECAI), pages 465-470, 2014. doi
A. El Mouelhi, P. Jégou and C. Terrioux. Hidden Tractable Classes: from Theory to Practice.
In Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 437-445, 2014. doi
P. Jégou and C. Terrioux. Bag-Connected Tree-Width: A New Parameter for Graph Decomposition.
In International Symposium on Artificial Intelligence and Mathematics (ISAIM), 2014.
A. El Mouelhi, P. Jégou, C. Terrioux and B. Zanuttini. Some New Tractable Classes of CSPs and their Relations with Backtracking Algorithms.
In Proceedings of the 10th International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming (CPAIOR), pages 61-76, 2013. doi
A. El Mouelhi, P. Jégou and C. Terrioux. A Hybrid Tractable Class for Non-Binary CSPs.
In Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 947-954, 2013. doi
A. El Mouelhi, P. Jégou and C. Terrioux. Microstructures for CSPs with Constraints of Arbitrary Arity.
In 10th Symposium on Abstraction, Reformulation, and Approximation (SARA), 2013.
A. El Mouelhi, P. Jégou, C. Terrioux and B. Zanuttini. On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems.
In International Symposium on Artificial Intelligence and Mathematics (ISAIM), 2012.
P. Jégou and C. Terrioux. A New Filtering Based on Decomposition of Constraint Sub-Networks.
In Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 263-270, 2010. doi
D. Habet, L. Paris and C. Terrioux. A Tree Decomposition Based Approach to Solve Structured SAT Instances.
In Proceedings of the 21st IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 115-122, 2009. doi
P. Jégou, S. N. Ndiaye and C. Terrioux. Combined Strategies for Decomposition-based Methods for solving CSPs.
In Proceedings of the 21st IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 184-192, 2009. doi
C. Pinto and C. Terrioux. A generalized Cyclic-Clustering Approach for Solving Structured CSPs.
In Proceedings of the 21st IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2009), pages 724-728, 2009. doi
S. N. Ndiaye, P. Jégou and C. Terrioux. Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems.
In Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 299-306, 2008. doi
P. Jégou, S. N. Ndiaye and C. Terrioux. A New Evaluation of Forward Checking and its Consequences on Efficiency of Tools for Decomposition of CSPs.
In Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 486-490, 2008. doi
C. Pinto and C. Terrioux. A New Method for Computing Suitable Tree-decompositions with Respect to Structured CSP Solving.
In Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 491-495, 2008. doi
P. Jégou, S. N. Ndiaye and C. Terrioux. Dynamic Management of Heuristics for Solving Structured CSPs.
In Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP), pages 364-378, 2007. doi
P. Jégou, S. N. Ndiaye and C. Terrioux. Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs.
In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI), pages 112-117, 2007.
P. Jégou, S. N. Ndiaye and C. Terrioux. An extension of complexity bounds and dynamic heuristics for tree-decompositions of CSP.
In Proceedings of the 12th International Conference on Principles and Practice of Constraint Programming (CP), pages 741-745, 2006. doi
K. Boutaleb, P. Jégou and C. Terrioux. (No)good Recording and ROBDDs for Solving Structured (V)CSPs.
In Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 297-304, 2006. doi
P. Jégou, S. N. Ndiaye and C. Terrioux. Computing and exploiting tree-decompositions for solving constraint networks.
In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP), pages 777-781, 2005. doi
P. Jégou and C. Terrioux. Decomposition and Good Recording.
In Proceedings of the 16th European Conference on Artificial Intelligence (ECAI), pages 196-200, 2004.
P. Jégou and C. Terrioux. A time-space trade-off for constraint networks decomposition.
In Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 234-239, 2004. doi
C. Terrioux and P. Jégou. Bounded backtracking for the valued constraint satisfaction problems.
In Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP), pages 709-723, 2003. doi
C. Terrioux. Cooperative Search and Nogood Recording.
In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI), pages 260-265, 2001.

International Workshops (14)

D. Habet and C. Terrioux. Conflict History Based Branching Heuristic for CSP Solving.
In Proceedings of the 8th International Workshop on Combinations of Intelligent Methods and Applications (CIMA), pages 70–80, 2018.
P. Jégou, H. Kanso and C. Terrioux. Exact Solution Counting for Artificial Intelligence based on Decomposition of Constraint Networks.
In Workshop on Constraint Programming and Artificial Intelligence, 2016.
A. El Mouelhi, P. Jégou and C. Terrioux. Hidden Tractable Classes.
In First Workshop on Bridging the Gap Between Theory and Practice in Constraint Solvers, 2014.
A. El Mouelhi, P. Jégou, C. Terrioux and B. Zanuttini. Some New Tractable Classes of CSPs and their Relations with Backtracking Algorithms.
In 4th International Workshop on the Cross-Fertilization Between CSP and SAT (CSPSAT), 2014.
A. El Mouelhi, P. Jégou and C. Terrioux. Different Classes of Graphs to Represent Microstructures for CSPs.
In 3rd International Workshop on Graph Structures for Knowledge Representation and Reasoning, 2013.
P. Jégou and C. Terrioux. Structural Consistency: A New Filtering Approach for Constraint Networks.
In Proceedings of the 1st Workshop on Constraint Reasoning and Graphical Structures, 2010.
P. Jégou, S. N. Ndiaye and C. Terrioux. Hypertree decomposition vs tree decomposition for solving constraint networks.
In International Workshop on Graph Decomposition: Theoretical, Algorithmic and Logical Aspect, CIRM, 2008.
M. Sanchez, S. Bouveret, S. de Givry, F. Heras, P. Jégou, J. Larrosa, S. N. Ndiaye, E. Rollon, T. Schiex, C. Terrioux, G. Verfaillie and M. Zytnicki. Max-CSP competition 2008: toulbar2 solver description.
In Proceedings of the 3rd CSP Solver Competition, pages 63-70, 2008.
P. Jégou, S. N. Ndiaye and C. Terrioux. Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems.
In Proceedings of the 4th Multidisciplinary Workshop on Advances in Preference Handling (M-PREF), pages 61-66, 2008.
S. N. Ndiaye and C. Terrioux. A generic bounded backtracking framework for solving CSPs.
In Proceedings of the Annual Workshop of ERCIM on Constraint Solving and Constraint Logic Programming (CSCLP'07), 2007.
P. Jégou, S. N. Ndiaye and C. Terrioux. Dynamic heuristics for branch and bound search on tree-decomposition of Weighted CSPs.
In Proceedings of the Eighth International Workshop on Preferences and Soft Constraints (Soft), pages 63-77, 2006.
K. Boutaleb, P. Jégou and C. Terrioux. Storing learnt (no)goods in ROBDDs for solving structured CSPs.
In Proceedings of the AAAI Workshop Learning for Search, 2006.
K. Boutaleb, P. Jégou and C. Terrioux. Optimizing the space to extend the tractability of (valued) structured CSP.
In Proceedings of the Annual Workshop of ERCIM on Constraint Solving and Constraint Logic Programming (CSCLP'06), pages 85-99, 2006.
P. Jégou, S. N. Ndiaye and C. Terrioux. Strategies and heuristics for exploiting tree-decompositions of constraint networks.
In Proceedings of the ECAI Workshop Inference methods based on Graphical Structures of Knowledge (WIGSK'06), pages 13-18, 2006.

National Conferences (36)

D. Habet, Y. El Ghazi and C. Terrioux. Conception des lignes d'un réseau de transport maritime à l'aide de la PPC.
In Actes des 18èmes Journées Francophones de Programmation par Contraintes (JFPC), pages 103-112, 2023. (in french)
Y. Carissan, D. Hagebaum-Reignier, N. Prcovic, C. Terrioux and A. Varet. Utiliser la PPC pour générer des structures de benzénoïdes en chimie théorique.
In Actes des 16èmes Journées Francophones de Programmation par Contraintes (JFPC), 2021. (in french)
Y. Carissan, D. Hagebaum-Reignier, N. Prcovic, C. Terrioux and A. Varet. Prise en compte de motifs et génération de structures de benzénoïdes.
In Actes des 16èmes Journées Francophones de Programmation par Contraintes (JFPC), 2021. (in french)
M. S. Cherif, D. Habet and C. Terrioux. Raffiner l'heuristique CHS à l'aide de bandits.
In Actes des 16èmes Journées Francophones de Programmation par Contraintes (JFPC), 2021. (in french)
M. S. Cherif, D. Habet and C. Terrioux. Un bandit manchot pour combiner CHB et VSIDS.
In Actes des 16èmes Journées Francophones de Programmation par Contraintes (JFPC), 2021. (in french)
P. Jégou and C. Terrioux. Décompositions structurelles et sémantiques Rapport préliminaire.
In Actes des 15èmes Journées Francophones de Programmation par Contraintes (JFPC), pages 3-6, 2019. (in french)
D. Habet and C. Terrioux. Une heuristique basée sur l'historique des conflits pour les problèmes de satisfaction de contraintes.
In Actes des 15èmes Journées Francophones de Programmation par Contraintes (JFPC), pages 153-154, 2019. (in french)
P. Jégou, H. Kanso and C. Terrioux. Sur la pertinence des décompositions arborescentes optimales pour la résolution de CSP.
In Actes des 15èmes Journées Francophones de Programmation par Contraintes (JFPC), pages 165-166, 2019. (in french)
A. El Mouelhi, P. Jégou and C. Terrioux. Autoriser des tuples interdits pour rendre une instance CSP traitable.
In Actes des 13ème Journées Francophones de Programmation par Contraintes (JFPC), pages 121-130, 2017. (in french)
P. Jégou, H. Kanso and C. Terrioux. Améliorer les méthodes de décomposition pour le dénombrement exact de solutions.
In Actes des 13ème Journées Francophones de Programmation par Contraintes (JFPC), pages 131-132, 2017. (in french)
P. Jégou, H. Kanso and C. Terrioux. Vers une exploitation dynamique de la décomposition pour les CSPs pondérés.
In Actes des 13ème Journées Francophones de Programmation par Contraintes (JFPC), pages 187-196, 2017. (in french)
P. Jégou, H. Kanso and C. Terrioux. Vers une décomposition dynamique des CSP.
In Actes des 12ème Journées Francophones de Programmation par Contraintes (JFPC), pages 123-132, 2016. (in french)
M. Cooper, A. El Mouelhi and C. Terrioux. Les triangles cassés, encore et encore.
In Actes des 12ème Journées Francophones de Programmation par Contraintes (JFPC), pages 133-141, 2016. (in french)
A. El Mouelhi, P. Jégou and C. Terrioux. Classes Polynomiales Cachées : de la théorie à la pratique.
In Actes des 11ème Journées Francophones de Programmation par Contraintes (JFPC), pages 16-17, 2015. (in french)
M. Cooper, A. El Mouelhi, C. Terrioux and B. Zanuttini. Autour des Triangles Cassés.
In Actes des 11ème Journées Francophones de Programmation par Contraintes (JFPC), pages 57-58, 2015. (in french)
M. Cooper, P. Jégou and C. Terrioux. Une famille de classes polynomiales de CSP basée sur la microstructure.
In Actes des 11ème Journées Francophones de Programmation par Contraintes (JFPC), pages 59-68, 2015. (in french)
P. Jégou, H. Kanso and C. Terrioux. De nouvelles approches pour la décomposition de réseaux de contraintes.
In Actes des 11ème Journées Francophones de Programmation par Contraintes (JFPC), pages 140-149, 2015. (in french)
P. Jégou and C. Terrioux. Combiner les Redémarrages, Nogoods et Décompositions pour la Résolution de CSP.
In Actes des 10ème Journées Francophones de Programmation par Contraintes (JFPC), pages 19-28, 2014. (in french)
P. Jégou and C. Terrioux. Un nouveau paramètre de graphes pour la résolution de CSP par décomposition.
In Actes des 10ème Journées Francophones de Programmation par Contraintes (JFPC), pages 77-88, 2014. (in french)
A. El Mouelhi, P. Jégou and C. Terrioux. Microstructures pour CSP d’arité quelconque.
In Actes des 10ème Journées Francophones de Programmation par Contraintes (JFPC), pages 193-202, 2014. (in french)
A. El Mouelhi, P. Jégou and C. Terrioux. Sur une classe polynomiale hybride pour les CSP d'arité quelconque.
In Actes des 9ème Journées Francophones de Programmation par Contraintes (JFPC), pages 237-247, 2013. (in french)
A. El Mouelhi, P. Jégou, C. Terrioux and B. Zanuttini. Sur la complexité des algorithmes de backtracking et quelques nouvelles classes polynomiales pour CSP.
In Actes des 8ème Journées Francophones de Programmation par Contraintes (JFPC), pages 160-169, 2012. (in french)
P. Jégou and C. Terrioux. Une nouvelle technique de filtrage basée sur la décomposition de sous-réseaux de contraintes.
In Actes des 6ème Journées Francophones de Programmation par Contraintes (JFPC), pages 157-166, 2010. (in french)
C. Pinto and C. Terrioux. Une généralisation de l’approche Cyclic-Clustering pour la résolution de CSP structurés.
In Actes des 5ème Journées Francophones de Programmation par Contraintes (JFPC), pages 5-14, 2009. (in french)
P. Jégou, S. N. Ndiaye and C. Terrioux. Stratégies hybrides pour des décompositions optimales et efficaces.
In Actes des 5ème Journées Francophones de Programmation par Contraintes (JFPC), pages 35-44, 2009. (in french)
D. Habet, L. Paris and C. Terrioux. Une approche basée sur la décomposition arborescente pour la résolution d'instances SAT structurées.
In Actes des 5ème Journées Francophones de Programmation par Contraintes (JFPC), pages 85-94, 2009. (in french)
P. Jégou, S. N. Ndiaye and C. Terrioux. Complexité de Forward Checking et Hiérarchie des Décompositions de CSP Revisitées.
In Actes des 4ème Journées Francophones de Programmation par Contraintes (JFPC), pages 153-163, 2008. (in french)
S. N. Ndiaye and C. Terrioux. Un schéma générique d'algorithmes énumératifs avec (no)good recording pour la résolution bornée de CSP.
In Actes des 3ème Journées Francophones de Programmation par Contraintes (JFPC), pages 209-218, 2007. (in french)
P. Jégou, S. N. Ndiaye and C. Terrioux. Recouvrement de problèmes par des hypergraphes acycliques : analyses théorique et expérimentale.
In Actes des 3ème Journées Francophones de Programmation par Contraintes (JFPC), pages 271-280, 2007. (in french)
P. Jégou, S. N. Ndiaye and C. Terrioux. Heuristiques pour la recherche énumérative bornée : Vers une libération de l'ordre.
In Actes des 2ème Journées Francophones de Programmation par Contraintes (JFPC), pages 219-228, 2006. (in french)
P. Jégou, S. N. Ndiaye and C. Terrioux. Sur la génération et l’exploitation de décompositions pour la résolution de réseaux de contraintes.
In Actes des 1ères Journées Francophones de Programmation par Contraintes (JFPC), pages 149-158, 2005. (in french)
P. Jégou and C. Terrioux. Un compromis temps-espace pour la résolution de réseaux de contraintes par décomposition.
In Actes des 1ères Journées Francophones de Programmation par Contraintes (JFPC), pages 159-168, 2005. (in french)
P. Jégou and C. Terrioux. Décomposition et Good Recording pour le problème Max-CSP.
In Actes des 10ème Journées Nationales sur la Résolution Pratique des Problèmes NP-Complets (JNPC), pages 219-234, 2004. (in french)
P. Jégou and C. Terrioux. Recherche arborescente bornée pour la résolution de CSP valués.
In Actes des 9ème Journées Nationales sur la Résolution Pratique des Problèmes NP-Complets (JNPC), pages 161-175, 2003. (in french)
P. Jégou and C. Terrioux. Recherche arborescente bornée.
In Actes des 8ème Journées Nationales sur la Résolution Pratique des Problèmes NP-Complets (JNPC), pages 127-141, 2002. (in french)
C. Terrioux. Recherche Coopérative et Nogood Recording.
In Actes des Journées Francophones de Programmation en Logique et par Contraintes (JFPLC), pages 173-187, 2001. (in french)

Phd Thesis (1)

C. Terrioux. Approches structurelles et coopératives pour la résolution des problèmes de satisfaction de contraintes.
PhD thesis, Université de Provence, December 2002. (in french)

Habilitation (1)

C. Terrioux. Classes polynomiales du problème CSP : entre théorie et pratique.
Habilitation, Aix-Marseille Université, December 2016. Slide (in french)

Technical Reports (13)

M. Cooper, A. El Mouelhi and C. Terrioux. Variable elimination in binary CSPs.
Technical report arXiv:1905.04209, 38 pages, 2019.
P. Jégou and C. Terrioux. A New Filtering Based on Decomposition of Constraint Sub-Networks.
Technical report, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 2010.
D. Habet, L. Paris and C. Terrioux. A Tree Decomposition Based Approach to Solve Structured Satisfiability Instances.
Technical report LSIS/2009/002, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 2009.
C. Pinto and C. Terrioux. A generalized Cyclic-Clustering Approach for Solving Structured CSPs.
Technical report LSIS/2009/004, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 10 pages, 2009.
P. Jégou, S. N. Ndiaye and C. Terrioux. A new Evaluation of Forward Checking and its Consequences on Efficiency of Tools for Decomposition of CSPs.
Technical report LSIS/2008/002, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 2008.
C. Pinto and C. Terrioux. A New Method for Computing Suitable Tree-decompositions with respect to Structured CSP Solving.
Technical report LSIS/2008/003, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 2008.
P. Jégou, S. N. Ndiaye and C. Terrioux. Heuristiques pour la recherche énumérative bornée : Vers une libération de l'ordre.
Technical report LSIS/2006/004, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 12 pages, 2006. (in french)
P. Jégou, S. N. Ndiaye and C. Terrioux. Computing and exploiting tree-decompositions for (Max-)CSP.
Technical report LSIS/2005/005, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 11 pages, 2005.
P. Jégou and C. Terrioux. A time-space trade-off for constraint networks decomposition.
Technical report LSIS/2004/005, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 12 pages, 2004.
C. Terrioux. Exchanging nogoods: an efficient cooperative search for solving constraint satisfaction problems.
Technical report LSIS/2003/002, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 26 pages, 2003.
P. Jégou and C. Terrioux. Recherche arborescente bornée pour la résolution de CSP valués.
Technical report LSIS/2003/003, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 13 pages, 2003. (in french)
P. Jégou and C. Terrioux. Hybrid backtracking bounded by tree-decomposition of constraint networks.
Technical report LSIS/2002/005, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 27 pages, 2002.
C. Terrioux. Cooperative search vs classical algorithms.
Technical report LSIS/2002/006, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 12 pages, 2002.

Proceedings (1)

C. Terrioux. Actes des 14èmes Journées Francophones de Programmation par Contraintes (JFPC).
2018. (in french)

+ List of publications by year

2023 (3)

N. Adrar, P. Jégou and C. Terrioux. Computing partial hypergraphs of bounded width.
In Discrete Applied Mathematics, 329, pages 1-22, 2023. doi
D. Habet, Y. El Ghazi and C. Terrioux. A CP Approach for the Liner Shipping Network Design Problem.
In Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, pages 16:1-16:21, 2023. doi
D. Habet, Y. El Ghazi and C. Terrioux. Conception des lignes d'un réseau de transport maritime à l'aide de la PPC.
In Actes des 18èmes Journées Francophones de Programmation par Contraintes (JFPC), pages 103-112, 2023. (in french)

2022 (2)

Y. Carissan, D. Hagebaum-Reignier, N. Prcovic, C. Terrioux and A. Varet. How constraint programming can help chemists to generate Benzenoid structures and assess the local Aromaticity of Benzenoids.
In Constraints, 27(3), pages 192-248, 2022. doi
A. Varet, N. Prcovic, C. Terrioux, D. Hagebaum-Reignier and Y. Carissan. BenzAI: A Program to Design Benzenoids with Defined Properties Using Constraint Programming.
In Journal of Chemical Information and Modeling, 62(11), pages 2811-2820, 2022. doi

2021 (7)

D. Habet and C. Terrioux. Conflict History Based Heuristic for Constraint Satisfaction Problem Solving.
In Journal of Heuristics, 27(6), pages 951-990, 2021. doi
Y. Carissan, D. Hagebaum-Reignier, N. Prcovic, C. Terrioux and A. Varet. Exhaustive Generation of Benzenoid Structures Sharing Common Patterns.
In Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), pages 19:1-19:18, 2021.
M. S. Cherif, D. Habet and C. Terrioux. Combining VSIDS and CHB Using Restarts in SAT.
In Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), pages 20:1-20-19, 2021.
Y. Carissan, D. Hagebaum-Reignier, N. Prcovic, C. Terrioux and A. Varet. Utiliser la PPC pour générer des structures de benzénoïdes en chimie théorique.
In Actes des 16èmes Journées Francophones de Programmation par Contraintes (JFPC), 2021. (in french)
Y. Carissan, D. Hagebaum-Reignier, N. Prcovic, C. Terrioux and A. Varet. Prise en compte de motifs et génération de structures de benzénoïdes.
In Actes des 16èmes Journées Francophones de Programmation par Contraintes (JFPC), 2021. (in french)
M. S. Cherif, D. Habet and C. Terrioux. Raffiner l'heuristique CHS à l'aide de bandits.
In Actes des 16èmes Journées Francophones de Programmation par Contraintes (JFPC), 2021. (in french)
M. S. Cherif, D. Habet and C. Terrioux. Un bandit manchot pour combiner CHB et VSIDS.
In Actes des 16èmes Journées Francophones de Programmation par Contraintes (JFPC), 2021. (in french)

2020 (4)

Y. Carissan, C. Dim, D. Hagebaum-Reignier, N. Prcovic, C. Terrioux and A. Varet. Computing the Local Aromaticity of Benzenoids Thanks to Constraint Programming.
In Proceedings of the 26th International Conference on Principles and Practice of Constraint Programming, pages 673-689, 2020. doi
Y. Carissan, D. Hagebaum-Reignier, N. Prcovic, C. Terrioux and A. Varet. Using Constraint Programming to Generate Benzenoid Structures in Theoretical Chemistry.
In Proceedings of the 26th International Conference on Principles and Practice of Constraint Programming, pages 690-706, 2020. doi
M. S. Cherif, D. Habet and C. Terrioux. On the Refinement of Conflict History Search Through Multi-Armed Bandit.
In Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 264-271, 2020. doi
M. Cooper, A. El Mouelhi and C. Terrioux. Variable Elimination in Binary CSPs (Extended Abstract).
In Proceedings of the Twenty-Ninth International Joint Conference on Artificial (IJCAI), Intelligence Journal track, pages 5035-5039, 2020. doi

2019 (6)

M. Cooper, A. El Mouelhi and C. Terrioux. Variable elimination in binary CSPs.
In Journal of Artificial Intelligence Research, 66, pages 589-624, 2019. doi
D. Habet and C. Terrioux. Conflict History based Search for Constraint Satisfaction Problem.
In Proceedings of the 34th ACM/SIGAPP Symposium On Applied Computing (SAC), Knowledge Representation and Reasoning Track, pages 1117–1122, 2019. doi
P. Jégou and C. Terrioux. Décompositions structurelles et sémantiques Rapport préliminaire.
In Actes des 15èmes Journées Francophones de Programmation par Contraintes (JFPC), pages 3-6, 2019. (in french)
D. Habet and C. Terrioux. Une heuristique basée sur l'historique des conflits pour les problèmes de satisfaction de contraintes.
In Actes des 15èmes Journées Francophones de Programmation par Contraintes (JFPC), pages 153-154, 2019. (in french)
P. Jégou, H. Kanso and C. Terrioux. Sur la pertinence des décompositions arborescentes optimales pour la résolution de CSP.
In Actes des 15èmes Journées Francophones de Programmation par Contraintes (JFPC), pages 165-166, 2019. (in french)
M. Cooper, A. El Mouelhi and C. Terrioux. Variable elimination in binary CSPs.
Technical report arXiv:1905.04209, 38 pages, 2019.

2018 (3)

P. Jégou, H. Kanso and C. Terrioux. On the Relevance of Optimal Tree Decompositions for Constraint Networks.
In Proceedings of the 30th International Conference on Tools with Artificial Intelligence (ICTAI), pages 738-743, 2018. doi
D. Habet and C. Terrioux. Conflict History Based Branching Heuristic for CSP Solving.
In Proceedings of the 8th International Workshop on Combinations of Intelligent Methods and Applications (CIMA), pages 70–80, 2018.
C. Terrioux. Actes des 14èmes Journées Francophones de Programmation par Contraintes (JFPC).
2018. (in french)

2017 (5)

P. Jégou and C. Terrioux. Combining Restarts, Nogoods and Bag-Connected Decompositions for Solving CSPs.
In Constraints, 22(2), pages 191-229, 2017. doi
P. Jégou, H. Kanso and C. Terrioux. Adaptive and Opportunistic Exploitation of Tree-Decompositions for Weighted CSPs..
In Proceedings of the 29th International Conference on Tools with Artificial Intelligence (ICTAI), pages 366-373, 2017. doi
A. El Mouelhi, P. Jégou and C. Terrioux. Autoriser des tuples interdits pour rendre une instance CSP traitable.
In Actes des 13ème Journées Francophones de Programmation par Contraintes (JFPC), pages 121-130, 2017. (in french)
P. Jégou, H. Kanso and C. Terrioux. Améliorer les méthodes de décomposition pour le dénombrement exact de solutions.
In Actes des 13ème Journées Francophones de Programmation par Contraintes (JFPC), pages 131-132, 2017. (in french)
P. Jégou, H. Kanso and C. Terrioux. Vers une exploitation dynamique de la décomposition pour les CSPs pondérés.
In Actes des 13ème Journées Francophones de Programmation par Contraintes (JFPC), pages 187-196, 2017. (in french)

2016 (9)

M. Cooper, A. Duchein, A. El Mouelhi, G. Escamocher, C. Terrioux and B. Zanuttini. From Value Merging to a Tractable Class of General-Arity Constraint Satisfaction Problems.
In Artificial Intelligence, 234, pages 196-218, 2016. doi
M. Cooper, A. El Mouelhi and C. Terrioux. Extending Broken Triangles and Enhanced Value-merging.
In Proceedings of the 22nd International Conference on Principles and Practice of Constraint Programming (CP), pages 173-188, 2016. doi
P. Jégou, H. Kanso and C. Terrioux. Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size.
In Proceedings of the 22nd International Conference on Principles and Practice of Constraint Programming (CP), pages 298-315, 2016. doi
P. Jégou, H. Kanso and C. Terrioux. Improving Exact Solution Counting for Decomposition Methods.
In Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 327-334, 2016. doi
M. Cooper, A. El Mouelhi, C. Terrioux, B. Zanuttini and P. Jégou. On Broken Triangles.
In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), pages 4135-4139, 2016. (Sister Conference Best Paper Track)
P. Jégou, H. Kanso and C. Terrioux. Exact Solution Counting for Artificial Intelligence based on Decomposition of Constraint Networks.
In Workshop on Constraint Programming and Artificial Intelligence, 2016.
P. Jégou, H. Kanso and C. Terrioux. Vers une décomposition dynamique des CSP.
In Actes des 12ème Journées Francophones de Programmation par Contraintes (JFPC), pages 123-132, 2016. (in french)
M. Cooper, A. El Mouelhi and C. Terrioux. Les triangles cassés, encore et encore.
In Actes des 12ème Journées Francophones de Programmation par Contraintes (JFPC), pages 133-141, 2016. (in french)
C. Terrioux. Classes polynomiales du problème CSP : entre théorie et pratique.
Habilitation, Aix-Marseille Université, December 2016. Slide (in french)

2015 (8)

A. El Mouelhi, P. Jégou and C. Terrioux. A Hybrid Tractable Class for Non-Binary CSPs.
In Constraints, 20 (4), pages 383-413, 2015. doi
P. Jégou and C. Terrioux. The Extendable-Triple Property: a new CSP Tractable Class beyond BTP.
In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI), pages 3746-3754, 2015.
M. Cooper, P. Jégou and C. Terrioux. A Microstructure-based Family of Tractable Classes for CSPs.
In Proceedings of the 21st International Conference on Principles and Practice of Constraint Programming (CP), pages 74-88, 2015. doi
P. Jégou, H. Kanso and C. Terrioux. An Algorithmic Framework for Decomposing Constraint Networks.
In Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 1-8, 2015. doi
A. El Mouelhi, P. Jégou and C. Terrioux. Classes Polynomiales Cachées : de la théorie à la pratique.
In Actes des 11ème Journées Francophones de Programmation par Contraintes (JFPC), pages 16-17, 2015. (in french)
M. Cooper, A. El Mouelhi, C. Terrioux and B. Zanuttini. Autour des Triangles Cassés.
In Actes des 11ème Journées Francophones de Programmation par Contraintes (JFPC), pages 57-58, 2015. (in french)
M. Cooper, P. Jégou and C. Terrioux. Une famille de classes polynomiales de CSP basée sur la microstructure.
In Actes des 11ème Journées Francophones de Programmation par Contraintes (JFPC), pages 59-68, 2015. (in french)
P. Jégou, H. Kanso and C. Terrioux. De nouvelles approches pour la décomposition de réseaux de contraintes.
In Actes des 11ème Journées Francophones de Programmation par Contraintes (JFPC), pages 140-149, 2015. (in french)

2014 (12)

A. El Mouelhi, P. Jégou and C. Terrioux. Different Classes of Graphs to Represent Microstructures for CSPs.
Graph Structures for Knowledge Representation and Reasoning, LNAI 8323, pages 21-38, 2014. doi
P. Jégou and C. Terrioux. Structural Consistency: A New Filtering Approach for Constraint Networks.
Graph Structures for Knowledge Representation and Reasoning, LNAI 8323, pages 74-91, 2014. doi
M. Cooper, A. El Mouelhi, C. Terrioux and B. Zanuttini. On Broken Triangles.
In Proceedings of the 20th International Conference on Principles and Practice of Constraint Programming (CP), pages 9-24, 2014. (best technical paper) doi
P. Jégou and C. Terrioux. Tree-Decompositions with Connected Clusters for Solving Constraint Networks.
In Proceedings of the 20th International Conference on Principles and Practice of Constraint Programming (CP), pages 407-423, 2014. doi
P. Jégou and C. Terrioux. Combining Restarts, Nogoods and Decompositions for Solving CSPs.
In Proceedings of the 21st European Conference on Artifcial Intelligence (ECAI), pages 465-470, 2014. doi
A. El Mouelhi, P. Jégou and C. Terrioux. Hidden Tractable Classes: from Theory to Practice.
In Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 437-445, 2014. doi
P. Jégou and C. Terrioux. Bag-Connected Tree-Width: A New Parameter for Graph Decomposition.
In International Symposium on Artificial Intelligence and Mathematics (ISAIM), 2014.
A. El Mouelhi, P. Jégou and C. Terrioux. Hidden Tractable Classes.
In First Workshop on Bridging the Gap Between Theory and Practice in Constraint Solvers, 2014.
A. El Mouelhi, P. Jégou, C. Terrioux and B. Zanuttini. Some New Tractable Classes of CSPs and their Relations with Backtracking Algorithms.
In 4th International Workshop on the Cross-Fertilization Between CSP and SAT (CSPSAT), 2014.
P. Jégou and C. Terrioux. Combiner les Redémarrages, Nogoods et Décompositions pour la Résolution de CSP.
In Actes des 10ème Journées Francophones de Programmation par Contraintes (JFPC), pages 19-28, 2014. (in french)
P. Jégou and C. Terrioux. Un nouveau paramètre de graphes pour la résolution de CSP par décomposition.
In Actes des 10ème Journées Francophones de Programmation par Contraintes (JFPC), pages 77-88, 2014. (in french)
A. El Mouelhi, P. Jégou and C. Terrioux. Microstructures pour CSP d’arité quelconque.
In Actes des 10ème Journées Francophones de Programmation par Contraintes (JFPC), pages 193-202, 2014. (in french)

2013 (5)

A. El Mouelhi, P. Jégou, C. Terrioux and B. Zanuttini. Some New Tractable Classes of CSPs and their Relations with Backtracking Algorithms.
In Proceedings of the 10th International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming (CPAIOR), pages 61-76, 2013. doi
A. El Mouelhi, P. Jégou and C. Terrioux. A Hybrid Tractable Class for Non-Binary CSPs.
In Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 947-954, 2013. doi
A. El Mouelhi, P. Jégou and C. Terrioux. Microstructures for CSPs with Constraints of Arbitrary Arity.
In 10th Symposium on Abstraction, Reformulation, and Approximation (SARA), 2013.
A. El Mouelhi, P. Jégou and C. Terrioux. Different Classes of Graphs to Represent Microstructures for CSPs.
In 3rd International Workshop on Graph Structures for Knowledge Representation and Reasoning, 2013.
A. El Mouelhi, P. Jégou and C. Terrioux. Sur une classe polynomiale hybride pour les CSP d'arité quelconque.
In Actes des 9ème Journées Francophones de Programmation par Contraintes (JFPC), pages 237-247, 2013. (in french)

2012 (2)

A. El Mouelhi, P. Jégou, C. Terrioux and B. Zanuttini. On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems.
In International Symposium on Artificial Intelligence and Mathematics (ISAIM), 2012.
A. El Mouelhi, P. Jégou, C. Terrioux and B. Zanuttini. Sur la complexité des algorithmes de backtracking et quelques nouvelles classes polynomiales pour CSP.
In Actes des 8ème Journées Francophones de Programmation par Contraintes (JFPC), pages 160-169, 2012. (in french)

2010 (4)

P. Jégou and C. Terrioux. A New Filtering Based on Decomposition of Constraint Sub-Networks.
In Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 263-270, 2010. doi
P. Jégou and C. Terrioux. Structural Consistency: A New Filtering Approach for Constraint Networks.
In Proceedings of the 1st Workshop on Constraint Reasoning and Graphical Structures, 2010.
P. Jégou and C. Terrioux. Une nouvelle technique de filtrage basée sur la décomposition de sous-réseaux de contraintes.
In Actes des 6ème Journées Francophones de Programmation par Contraintes (JFPC), pages 157-166, 2010. (in french)
P. Jégou and C. Terrioux. A New Filtering Based on Decomposition of Constraint Sub-Networks.
Technical report, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 2010.

2009 (8)

D. Habet, L. Paris and C. Terrioux. A Tree Decomposition Based Approach to Solve Structured SAT Instances.
In Proceedings of the 21st IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 115-122, 2009. doi
P. Jégou, S. N. Ndiaye and C. Terrioux. Combined Strategies for Decomposition-based Methods for solving CSPs.
In Proceedings of the 21st IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 184-192, 2009. doi
C. Pinto and C. Terrioux. A generalized Cyclic-Clustering Approach for Solving Structured CSPs.
In Proceedings of the 21st IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2009), pages 724-728, 2009. doi
C. Pinto and C. Terrioux. Une généralisation de l’approche Cyclic-Clustering pour la résolution de CSP structurés.
In Actes des 5ème Journées Francophones de Programmation par Contraintes (JFPC), pages 5-14, 2009. (in french)
P. Jégou, S. N. Ndiaye and C. Terrioux. Stratégies hybrides pour des décompositions optimales et efficaces.
In Actes des 5ème Journées Francophones de Programmation par Contraintes (JFPC), pages 35-44, 2009. (in french)
D. Habet, L. Paris and C. Terrioux. Une approche basée sur la décomposition arborescente pour la résolution d'instances SAT structurées.
In Actes des 5ème Journées Francophones de Programmation par Contraintes (JFPC), pages 85-94, 2009. (in french)
D. Habet, L. Paris and C. Terrioux. A Tree Decomposition Based Approach to Solve Structured Satisfiability Instances.
Technical report LSIS/2009/002, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 2009.
C. Pinto and C. Terrioux. A generalized Cyclic-Clustering Approach for Solving Structured CSPs.
Technical report LSIS/2009/004, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 10 pages, 2009.

2008 (9)

S. N. Ndiaye, P. Jégou and C. Terrioux. Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems.
In Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 299-306, 2008. doi
P. Jégou, S. N. Ndiaye and C. Terrioux. A New Evaluation of Forward Checking and its Consequences on Efficiency of Tools for Decomposition of CSPs.
In Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 486-490, 2008. doi
C. Pinto and C. Terrioux. A New Method for Computing Suitable Tree-decompositions with Respect to Structured CSP Solving.
In Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 491-495, 2008. doi
P. Jégou, S. N. Ndiaye and C. Terrioux. Hypertree decomposition vs tree decomposition for solving constraint networks.
In International Workshop on Graph Decomposition: Theoretical, Algorithmic and Logical Aspect, CIRM, 2008.
M. Sanchez, S. Bouveret, S. de Givry, F. Heras, P. Jégou, J. Larrosa, S. N. Ndiaye, E. Rollon, T. Schiex, C. Terrioux, G. Verfaillie and M. Zytnicki. Max-CSP competition 2008: toulbar2 solver description.
In Proceedings of the 3rd CSP Solver Competition, pages 63-70, 2008.
P. Jégou, S. N. Ndiaye and C. Terrioux. Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems.
In Proceedings of the 4th Multidisciplinary Workshop on Advances in Preference Handling (M-PREF), pages 61-66, 2008.
P. Jégou, S. N. Ndiaye and C. Terrioux. Complexité de Forward Checking et Hiérarchie des Décompositions de CSP Revisitées.
In Actes des 4ème Journées Francophones de Programmation par Contraintes (JFPC), pages 153-163, 2008. (in french)
P. Jégou, S. N. Ndiaye and C. Terrioux. A new Evaluation of Forward Checking and its Consequences on Efficiency of Tools for Decomposition of CSPs.
Technical report LSIS/2008/002, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 2008.
C. Pinto and C. Terrioux. A New Method for Computing Suitable Tree-decompositions with respect to Structured CSP Solving.
Technical report LSIS/2008/003, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 2008.

2007 (6)

P. Jégou, S. N. Ndiaye and C. Terrioux. Dynamic heuristics for Branch and Bound search on Tree-decomposition of Weighted CSPs.
Trends in Constraint Programming, ISTE (Ed.), chapter 20, pages 317-332, 2007.
P. Jégou, S. N. Ndiaye and C. Terrioux. Dynamic Management of Heuristics for Solving Structured CSPs.
In Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP), pages 364-378, 2007. doi
P. Jégou, S. N. Ndiaye and C. Terrioux. Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs.
In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI), pages 112-117, 2007.
S. N. Ndiaye and C. Terrioux. A generic bounded backtracking framework for solving CSPs.
In Proceedings of the Annual Workshop of ERCIM on Constraint Solving and Constraint Logic Programming (CSCLP'07), 2007.
S. N. Ndiaye and C. Terrioux. Un schéma générique d'algorithmes énumératifs avec (no)good recording pour la résolution bornée de CSP.
In Actes des 3ème Journées Francophones de Programmation par Contraintes (JFPC), pages 209-218, 2007. (in french)
P. Jégou, S. N. Ndiaye and C. Terrioux. Recouvrement de problèmes par des hypergraphes acycliques : analyses théorique et expérimentale.
In Actes des 3ème Journées Francophones de Programmation par Contraintes (JFPC), pages 271-280, 2007. (in french)

2006 (8)

P. Jégou, S. N. Ndiaye and C. Terrioux. An extension of complexity bounds and dynamic heuristics for tree-decompositions of CSP.
In Proceedings of the 12th International Conference on Principles and Practice of Constraint Programming (CP), pages 741-745, 2006. doi
K. Boutaleb, P. Jégou and C. Terrioux. (No)good Recording and ROBDDs for Solving Structured (V)CSPs.
In Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 297-304, 2006. doi
P. Jégou, S. N. Ndiaye and C. Terrioux. Dynamic heuristics for branch and bound search on tree-decomposition of Weighted CSPs.
In Proceedings of the Eighth International Workshop on Preferences and Soft Constraints (Soft), pages 63-77, 2006.
K. Boutaleb, P. Jégou and C. Terrioux. Storing learnt (no)goods in ROBDDs for solving structured CSPs.
In Proceedings of the AAAI Workshop Learning for Search, 2006.
K. Boutaleb, P. Jégou and C. Terrioux. Optimizing the space to extend the tractability of (valued) structured CSP.
In Proceedings of the Annual Workshop of ERCIM on Constraint Solving and Constraint Logic Programming (CSCLP'06), pages 85-99, 2006.
P. Jégou, S. N. Ndiaye and C. Terrioux. Strategies and heuristics for exploiting tree-decompositions of constraint networks.
In Proceedings of the ECAI Workshop Inference methods based on Graphical Structures of Knowledge (WIGSK'06), pages 13-18, 2006.
P. Jégou, S. N. Ndiaye and C. Terrioux. Heuristiques pour la recherche énumérative bornée : Vers une libération de l'ordre.
In Actes des 2ème Journées Francophones de Programmation par Contraintes (JFPC), pages 219-228, 2006. (in french)
P. Jégou, S. N. Ndiaye and C. Terrioux. Heuristiques pour la recherche énumérative bornée : Vers une libération de l'ordre.
Technical report LSIS/2006/004, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 12 pages, 2006. (in french)

2005 (4)

P. Jégou, S. N. Ndiaye and C. Terrioux. Computing and exploiting tree-decompositions for solving constraint networks.
In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP), pages 777-781, 2005. doi
P. Jégou, S. N. Ndiaye and C. Terrioux. Sur la génération et l’exploitation de décompositions pour la résolution de réseaux de contraintes.
In Actes des 1ères Journées Francophones de Programmation par Contraintes (JFPC), pages 149-158, 2005. (in french)
P. Jégou and C. Terrioux. Un compromis temps-espace pour la résolution de réseaux de contraintes par décomposition.
In Actes des 1ères Journées Francophones de Programmation par Contraintes (JFPC), pages 159-168, 2005. (in french)
P. Jégou, S. N. Ndiaye and C. Terrioux. Computing and exploiting tree-decompositions for (Max-)CSP.
Technical report LSIS/2005/005, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 11 pages, 2005.

2004 (5)

P. Jégou and C. Terrioux. Recherche arborescente bornée pour la résolution de CSP valués.
In Journal électronique d’intelligence artificielle (JEDAI), 3(28), 2004. (in french)
P. Jégou and C. Terrioux. Decomposition and Good Recording.
In Proceedings of the 16th European Conference on Artificial Intelligence (ECAI), pages 196-200, 2004.
P. Jégou and C. Terrioux. A time-space trade-off for constraint networks decomposition.
In Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 234-239, 2004. doi
P. Jégou and C. Terrioux. Décomposition et Good Recording pour le problème Max-CSP.
In Actes des 10ème Journées Nationales sur la Résolution Pratique des Problèmes NP-Complets (JNPC), pages 219-234, 2004. (in french)
P. Jégou and C. Terrioux. A time-space trade-off for constraint networks decomposition.
Technical report LSIS/2004/005, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 12 pages, 2004.

2003 (5)

P. Jégou and C. Terrioux. Hybrid backtracking bounded by tree-decomposition of constraint networks.
In Artificial Intelligence, 146, pages 43-75, 2003. doi
C. Terrioux and P. Jégou. Bounded backtracking for the valued constraint satisfaction problems.
In Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP), pages 709-723, 2003. doi
P. Jégou and C. Terrioux. Recherche arborescente bornée pour la résolution de CSP valués.
In Actes des 9ème Journées Nationales sur la Résolution Pratique des Problèmes NP-Complets (JNPC), pages 161-175, 2003. (in french)
C. Terrioux. Exchanging nogoods: an efficient cooperative search for solving constraint satisfaction problems.
Technical report LSIS/2003/002, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 26 pages, 2003.
P. Jégou and C. Terrioux. Recherche arborescente bornée pour la résolution de CSP valués.
Technical report LSIS/2003/003, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 13 pages, 2003. (in french)

2002 (4)

P. Jégou and C. Terrioux. Recherche arborescente bornée.
In Actes des 8ème Journées Nationales sur la Résolution Pratique des Problèmes NP-Complets (JNPC), pages 127-141, 2002. (in french)
C. Terrioux. Approches structurelles et coopératives pour la résolution des problèmes de satisfaction de contraintes.
PhD thesis, Université de Provence, December 2002. (in french)
P. Jégou and C. Terrioux. Hybrid backtracking bounded by tree-decomposition of constraint networks.
Technical report LSIS/2002/005, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 27 pages, 2002.
C. Terrioux. Cooperative search vs classical algorithms.
Technical report LSIS/2002/006, Laboratoire des Sciences de l’Information et des Systèmes (LSIS), 12 pages, 2002.

2001 (2)

C. Terrioux. Cooperative Search and Nogood Recording.
In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI), pages 260-265, 2001.
C. Terrioux. Recherche Coopérative et Nogood Recording.
In Actes des Journées Francophones de Programmation en Logique et par Contraintes (JFPLC), pages 173-187, 2001. (in french)

Participation to funded projects

STAL-DEC-OPT project (December 2005 - December 2008): Strategies and algorithms for the decomposition and the solving of constraint optimization problems, national grant founded by the ANR (The French National Research Agency).
TUPLES project (October 2010 - April 2015): Tractability for Understanding and Pushing forward the Limits of Efficient Solving (TUPLES), national grant ANR-2010-BLAN-0210.
DEMOGRAPH project (April 2017 - March 2022): the ANR project DEMOGRAPH (Decomposition of Graphical Models) aims to study, from a theoretical and practical point of view, the interest of different notions of graph decompositions for the solving of graphical models.

Ph.D. supervision

Samba Ndojh Ndiaye (2004-2007): Computation and exploitation of acyclic covering for solving (Valued) CSP (co-supervised with Philippe Jégou)
Achref El Mouelhi (2011-2014): Tractable classes for CSP: from theory to practice (co-supervised with Philippe Jégou)
Hanan Kanso (2014-2017): Exploitation of decompositions and restart techniques for solving constraint satisfaction problems (co-supervised with Philippe Jégou)
Nabil Adrar (2018-...): New decompositions of graphs for solving graphical models (co-supervised with Philippe Jégou)
Adrien Varet (2019-...): Development and application of artificial intelligence techniques to the processing of graphical models in theoretical chemistry (co-supervised with Yannick Carissan)
Yousra El Ghazi (2022-...): Modeling and solving the optimal design problem of a maritime network (co-supervised with Djamal Habet)

Program committees and reviewing

Program chair of JFPC 2018
Participation to program committees
- International conferences:
  - AAAI Conference on Artificial Intelligence (AAAI) - 2008
  - European Conference on Artificial Intelligence (ECAI) - 2008
  - International Conference on Principles and Practice of Constraint Programming (CP) - 2019, 2021, 2022
  - International Joint Conference on Artificial Intelligence (IJCAI) - 2009, 2015, 2016, 2018, 2019, 2020, 2021, 2022
- National conferences:
  - Journées Francophones de Programmation par Contraintes (JFPC) - 2009, 2010, 2015, 2016, 2017
  - Journées nationales de la résolution pratique des problèmes NP-Complets (JNPC) - 2003, 2004
  - Reconnaissance des Formes et Intelligence Artificielle (RFIA) - 2008
Reviewing
- International journals:
  - AI Communications - 2013
  - Artificial Intelligence Journal - 2005
  - Discrete Mathematics & Theoretical Computer Science - 2018
  - International Journal on Artificial Intelligence Tools - 2019
  - Journal of Artificial Intelligence Research - 2017
  - RAIRO Operations Research - 2014
  - Studia Informatica Universalis - 2005
- International conferences:
  - AAAI Conference on Artificial Intelligence (AAAI) - 2007, 2016
  - ACM Symposium on Applied Computing (SAC), Special Track on Artificial Intelligence Computational Logic and Image Analysis - 2004
  - IEEE International Conference on Tools with Artificial Intelligence (ICTAI), Special Track on SAT and CSP Technologies - 2013
  - International Conference on Principles and Practice of Constraint Programming (CP) - 2006, 2014, 2015, 2016
  - International Joint Conference on Artificial Intelligence (IJCAI) - 2003

Organization

Participation in the organization of the Thematic School of the GDR-PRC-I3: "Nouveaux défis en Sciences de l'Information : Documents & Evolution" (September 2000)
Co-chair of the workshop SOFT 2006
Organizing comittee member of the international conferenceTABLEAUX 2007
Organizing comittee member of the national conferences JFPC and JIAF 2013