Publications

International journals

2020 Constraints Gilles Audemard, Frédéric Boussemart, Christophe Lecoutre, Cédric Piette, Olivier Roussel, XCSP3 and its ecosystem in Constraints Journal (Constraints),pp. 1-23, 2020.

2012 Matti Jarvisalo, Daniel Le Berre, Olivier Roussel, The International SAT Solver Competitions in AI magazine,vol. 1, n° 33, pp. 89-94, 2012.

2011 Olivier Roussel, Controlling a Solver Execution: the runsolver Tool in Journal on Satisfiability, Boolean Modeling and Computation,vol. 7, n° 4, pp. 139-144, 2011.

2010 Christophe Lecoutre, Olivier Roussel, Marc~r.C. van Dongen, Promoting Robust Black-Box Solvers Through Competitions in Constraints,vol. 15, n° 3, pp. 317-326, 2010.

2006 Olivier Bailleux, Yacine Boufkhad, Olivier Roussel, A Translation of Pseudo-Boolean Constraints to SAT in Journal on Satisfiability, Boolean Modeling and Computation,vol. 2, pp. 191-200, 2006.

2006 V. Manquinho, Olivier Roussel, The First Evaluation of Pseudo-Boolean Solvers (PB'05) in Journal on Satisfiability, Boolean Modeling and Computation,vol. 2, pp. 103-143, 2006.

2000 Philippe Mathieu, Olivier Roussel, The Achievement of Knowledge Bases by Cycle Search in Information and Computation,vol. 162, pp. 43--58, 2000.

International conferences

2024 Constraints Anthony Blomme, Daniel Berre, Anne Parrain, Olivier Roussel, Compressing UNSAT CDCL Trees with Caching in ICAART 2024: 16th International Conference on Agents and Artificial Intelligence,SCITEPRESS - Science and Technology Publications, vol. 3, pp. 792-799, 2024.

2024 Yann Barguil, Laura Chiaradia, Alba Iglesias-Gonzalez, Yves Letourneur, Madeline Duhin, Brice Appenzeller, Olivier Roussel, Vincent Cirimele, Mise en évidence par analyse capillaire de l’importance de l’exposition des enfants de Nouvelle-Calédonie aux métaux lourds in 61th Congrès Société Toxicologie Clinique,vol. 36, pp. S52, 2024.

2023 Explainable AI Anthony Blomme, Daniel Le Berre, Anne Parrain, Olivier Roussel, Compressing UNSAT Search Trees with Caching in ICAART 2023 : 15th International Conference on Agents and Artificial Intelligence,vol. 3, pp. 358-365, 2023.

2022 Constraints Gilles Audemard, Jean-Marie Lagniez, Marie Miceli, Olivier Roussel, Identifying Soft Cores in Propositional Formulae in 14th International Conference on Agents and Artificial Intelligence, ICAART,2022.

2014 Nebras Gharbi, Fred Hemery, Christophe Lecoutre, Olivier Roussel, Sliced Table Constraints: Combining Compression and Tabular Reduction in Integration of AI and OR Techniques in Constraint Programming (CPAIOR 2014),Springer International Publishing, vol. 8451, pp. 120-135, 2014.

2012 Christophe Lecoutre, Olivier Roussel, Djamel-Eddine Dehani, WCSP Integration of Soft Neighborhood Substitutability in 18th International Conference on Principles and Practice of Constraint Programming (CP'12),Springer, vol. 7415, pp. 406-421, 2012.

2012 Olivier Roussel, Behind the Scene of Solvers Competitions: the evaluation Experience in Comparative Empirical Evaluation of Reasoning Systems (COMPARE'12),pp. 66-77, 2012.

2012 Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sébastien Tabary, Propagating Soft Table Constraints in 18th International Conference on Principles and Practice of Constraint Programming (CP'12),Springer, vol. 7514, pp. 390-405, 2012.

2009 Olivier Bailleux, Yacine Boufkhad, Olivier Roussel, New Encodings of Pseudo-Boolean Constraints into CNF in Theory and Applications of Satisfiability Testing - SAT 2009,pp. 181-194, 2009.

2009 Christophe Lecoutre, Olivier Roussel, Failed Value Consistencies for Constraint Satisfaction in 15th International Conference on Principles and Practice of Constraint Programming (CP'09),Springer, vol. 5732, pp. 554-568, 2009.

2009 Christophe Lecoutre, Olivier Roussel, Cohérences basées sur les valeurs en échec in Cinquièmes Journées Francophones de Programmation par Contraintes,pp. 355-365, 2009.

2008 Hachemi Bennaceur, Christophe Lecoutre, Olivier Roussel, A decomposition strategy to reduce the search space of solutions of WCSP in 9th Workshop on Preferences and Soft Constraints (Soft'08),pp. 73-87, 2008.

2008 Hachemi Bennaceur, Christophe Lecoutre, Olivier Roussel, A Decomposition Technique for Solving {Max-CSP} in 18th European Conference on Artificial Intelligence (ECAI'08),pp. 500-504, 2008.

2005 Olivier Roussel, Some notes on the implementation of csp2sat+zchaff, a simple translator from CSP to SAT in Second International Workshop on Constraint Propagation and Implementation(CPAI05),vol. 2, pp. 83-88, 2005.

2004 Daniel Le Berre, Anne Parrain, Olivier Roussel, The long way from conflict driven clause learning to conflict driven constraint learning in Guangzhou Symposium on Satisfiability and its applications (Guangzhou04),2004.

2003 Gilles Audemard, Daniel Le Berre, Olivier Roussel, Ines Lynce, Joao Marques-Silva, OpenSAT: an open source SAT software project in Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT2003),2003.

1997 Philippe Mathieu, Olivier Roussel, Exact Knowledge Compilation in Predicate Calculus: the Partial Achievement Case in Proceedings of 14th International Conference on Automated Deduction (CADE'14),Springer, pp. 161--175, 1997.

1996 Philippe Mathieu, Olivier Roussel, How to Use Cycles for Logicial Compilation in Proceedings of the European Conference on Artificial Intelligence's Workshop on Advances in Propositional Deduction (APD@ECAI'96),pp. 53--60, 1996.

1996 Olivier Roussel, Philippe Mathieu, A New Method for Knowledge Compilation: The Achievement by Cycle Search in Proceedings of the 13th International Conference on Automated Deduction (CADE'13),Springer, vol. 1104, pp. 493--507, 1996.

National conferences

2023 Anthony Blomme, Daniel Le Berre, Anne Parrain, Olivier Roussel, Compresser des arbres de recherche UNSAT à l’aide d’un système de cache in Journées Francophones de Programmation par Contraintes (JFPC'23),pp. 38-45, 2023.

2014 Nebras Gharbi, Fred Hemery, Christophe Lecoutre, Olivier Roussel, Les contraintes table fragmentées : combiner la compression et la réduction tabulaire in 10èmes Journées Francophones de Programmation par Contraintes (JFPC'14),pp. 133-142, 2014.

2013 Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sébastien Tabary, Résolution du problème WCSP par extraction de noyaux insatisfiables minimaux in 9ièmes Journées Francophones de Programmation par Contraintes (JFPC'13),pp. 195-204, 2013.

2013 Nebras Gharbi, Fred Hemery, Christophe Lecoutre, Olivier Roussel, STR et compression de contraintes tables in 9ièmes Journées Francophones de Programmation par Contraintes (JFPC'13),pp. 143-146, 2013.

2013 Djamel-Eddine Dehani, Christophe Lecoutre, Olivier Roussel, Coherences de tuples pour WCSP in 9èmes Journées Francophones de Programmation par Contraintes (JFPC'13),pp. 105-113, 2013.

2013 Djamel-Eddine Dehani, Christophe Lecoutre, Olivier Roussel, Extension des cohérences WCSP aux tuples in 9ièmes Journées Francophones de Programmation par Contraintes (JFPC'13),pp. 105-113, 2013.

2012 Christophe Lecoutre, Nicolas Paris, Sébastien Tabary, Olivier Roussel, Propagation des contraintes tables souples Etude pr eliminaire in JFPC 2012,2012.

2012 Christophe Lecoutre, Djamel-Eddine Dehani, Olivier Roussel, Substituabilité au voisinage pour le cadre WCSP in JFPC - Huitièmes Journées Francophones de Programmation par Contraintes - 2012,2012.

2008 Hachémi Bennaceur, Christophe Lecoutre, Olivier Roussel, Une technique de décomposition pour Max-CSP in JFPC 2008- Quatrièmes Journées Francophones de Programmation par Contraintes,pp. 219-226, 2008.

2005 Olivier Roussel, Une autre conversion de SAT vers CSP in Premières Journées Francophones de Programmation par Contraintes,Université d'Artois, pp. 49-58, 2005.

2003 Gilles Audemard, Daniel Le Berre, Olivier Roussel, OpenSAT: une plateforme SAT Open Source in JNPC'03,2003.

1997 Olivier Roussel, Philippe Mathieu, Une compilation logique exacte en calcul des prédicats : le cas de l'achèvement total in Actes de la 3ème conférence nationale sur la résolution pratique de problèmes NP-complets (JNPC'97),pp. 61--66, 1997.

1996 Philippe Mathieu, Olivier Roussel, Une nouvelle Methode de Compilation Logique : L'Achèvement par Cycles in Actes des Journées Francophones de Programmation Logique et Contraintes (JFPLC'96),1996.

1995 Olivier Roussel, Philippe Mathieu, Evaluation des méthodes d'achèvement par parties in Actes des Journées Francophones de Programmation Logique (JFPL'95),pp. 175--189, 1995.

Book and proceedings editions

2008 Marc-R.C. van Dongen, Christophe Lecoutre, Olivier Roussel, Proceedings of the 3rd International Constraint Solver Competition (2008) pp. 90, pas d'éditeur commercial, 2008.

2008 Marc-R.C. van Dongen, Christophe Lecoutre, Olivier Roussel, Proceedings of the 2nd International Constraint Solver Competition (2006) pp. 96, pas d'éditeur commercial, 2008.

Book chapters

2021 Constraints Olivier Roussel, Vasco Manquinho, Pseudo-Boolean and Cardinality Constraints in Handbook of Satisfiability, second edition,vol. 336, pp. 1087-1129, IOS Press, 2021.

2009 Vasco Manquinho, Olivier Roussel, Pseudo-Boolean and Cardinality Constraints in Handbook of Satisfiability,,pp. 695-733, IOS Press, 2009.

Technical reports

2024 Daniel Crowley, Daniel Le Berre, Olivier Roussel, Yakoub Salhi, On Finding Counter-Models: Approach Based on Instantiating Abstract Sets 2024.

2012 Frederic Boussemart, Fred Hemery, Christophe Lecoutre, Olivier Roussel, Sébastien Tabary, Optimisation du montage de prêts immobiliers : modélisation du problème 2012.

2009 Christophe Lecoutre, Olivier Roussel, XML Representation of Constraint Networks: Format XCSP 2.1 2009.

2006 Christophe Lecoutre, Olivier Roussel, M. van Dongen, XML Representation of Constraint Networks: Format XCSP 2.0 2006.