Skip to Main content
Number of documents

43

Olivier Roussel's publications


Journal articles7 documents

  • Gilles Audemard, Frédéric Boussemart, Christophe Lecoutre, Cédric Piette, Olivier Roussel. XCSP3 and its ecosystem. Constraints Journal (Constraints), 2020, pp.1-23. ⟨hal-03299472⟩
  • Matti Jarvisalo, Daniel Le Berre, Olivier Roussel, Laurent Simon. The International SAT Solver Competitions. AI magazine, Association for the Advancement of Artificial Intelligence, 2012, 1 (33), pp.89-94. ⟨10.1609/aimag.v33i1.2395⟩. ⟨hal-00868244⟩
  • Olivier Roussel. Controlling a Solver Execution: the runsolver Tool. Journal on Satisfiability, Boolean Modeling and Computation, IOS Press, 2011, 7, pp.139-144. ⟨hal-00868234⟩
  • Christophe Lecoutre, Olivier Roussel, Marc~r.C. van Dongen. Promoting Robust Black-Box Solvers Through Competitions. Constraints, Springer Verlag, 2010, 15 (3), pp.317-326. ⟨hal-00868156⟩
  • Olivier Bailleux, Yacine Boufkhad, Olivier Roussel. A Translation of Pseudo Boolean Constraints to SAT. Journal on Satisfiability, Boolean Modeling and Computation, IOS Press, 2006, 2, pp.191-200. ⟨hal-00159880⟩
  • V. Manquinho, Olivier Roussel. The First Evaluation of Pseudo-Boolean Solvers (PB'05). Journal on Satisfiability, Boolean Modeling and Computation, IOS Press, 2006, 2, pp.103-143. ⟨hal-00110082⟩
  • Philippe Mathieu, Olivier Roussel. The Achievement of Knowledge Bases by Cycle Search. Information and Computation, Elsevier, 2000, 162, pp.43--58. ⟨hal-00731919⟩

Conference papers30 documents

  • Nebras Gharbi, Fred Hemery, Christophe Lecoutre, Olivier Roussel. Sliced Table Constraints: Combining Compression and Tabular Reduction. CPAIOR, May 2014, Cork, Ireland. ⟨10.1007/978-3-319-07046-9_9⟩. ⟨hal-01141409⟩
  • Nebras Gharbi, Fred Hemery, Christophe Lecoutre, Olivier Roussel. Constraint Solving using Parallel Singleton Arc Consistency. 1st Workshop on Cloud Computing and Optimization, 2014, Lyon, France. ⟨hal-03300632⟩
  • Nebras Gharbi, Fred Hemery, Christophe Lecoutre, Olivier Roussel. Les contraintes table fragmentées : combiner la compression et la réduction tabulaire. 10èmes Journées Francophones de Programmation par Contraintes (JFPC'14), 2014, Angers, France. pp.133-142. ⟨hal-03300635⟩
  • Djamel-Eddine Dehani, Christophe Lecoutre, Olivier Roussel. Coherences de tuples pour WCSP. 9èmes Journées Francophones de Programmation par Contraintes (JFPC'13), 2013, Aix en provence, France. pp.105-113. ⟨hal-03300932⟩
  • Christophe Lecoutre, Djamel-Eddine Dehani, Olivier Roussel. Substituabilité au voisinage pour le cadre WCSP. JFPC - Huitièmes Journées Francophones de Programmation par Contraintes - 2012, Apr 2013, Toulouse, France. ⟨hal-00818527⟩
  • Djamel-Eddine Dehani, Christophe Lecoutre, Olivier Roussel. Extension des cohérences WCSP aux tuples. 9ièmes Journées Francophones de Programmation par Contraintes (JFPC'13), 2013, Aix-en-Provence, France. pp.105-113. ⟨hal-00869928⟩
  • Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sebastien Tabary. Résolution du problème WCSP par extraction de noyaux insatisfiables minimaux. 9ièmes Journées Francophones de Programmation par Contraintes (JFPC'13), 2013, Aix-en-Provence, France. pp.195-204. ⟨hal-00869934⟩
  • Nebras Gharbi, Fred Hemery, Christophe Lecoutre, Olivier Roussel. STR et compression de contraintes tables. 9ièmes Journées Francophones de Programmation par Contraintes (JFPC'13), 2013, Aix-en-Provence, France. pp.143-146. ⟨hal-00869930⟩
  • Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sebastien Tabary. Propagating Soft Table Constraints. 18th International Conference on Principles and Practice of Constraint Programming (CP'12), 2012, Québec, Canada. pp.390-405. ⟨hal-00865618⟩
  • Olivier Roussel. Behind the Scene of Solvers Competitions: the evaluation Experience. Comparative Empirical Evaluation of Reasoning Systems (COMPARE'12), 2012, Manchester, United Kingdom. pp.66-77. ⟨hal-00865610⟩
  • Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sebastien Tabary. Propagation des contraintes tables souples - étude préliminaire. 8ièmes Journées Francophones de Programmation par Contraintes (JFPC'12), 2012, Toulouse, France. pp.196-201. ⟨hal-00869908⟩
  • Christophe Lecoutre, Nicolas Paris, Sébastien Tabary, Olivier Roussel. Propagation des contraintes tables souples Etude pr eliminaire. JFPC 2012, May 2012, Toulouse, France. ⟨hal-00810477⟩
  • Christophe Lecoutre, Olivier Roussel, Djamel-Eddine Dehani. WCSP Integration of Soft Neighborhood Substitutability. 18th International Conference on Principles and Practice of Constraint Programming (CP'12), 2012, Québec, Canada. pp.406-421. ⟨hal-00866333⟩
  • Olivier Bailleux, Yacine Boufkhad, Olivier Roussel. New Encodings of Pseudo-Boolean Constraints into CNF. Theory and Applications of Satisfiability Testing - SAT 2009, Jun 2009, Swansea, United Kingdom. pp.181-194. ⟨hal-00415126⟩
  • Christophe Lecoutre, Olivier Roussel. Failed Value Consistencies for Constraint Satisfaction. 15th International Conference on Principles and Practice of Constraint Programming (CP'09), 2009, Lisbon, Portugal. pp.554-568. ⟨hal-00865327⟩
  • Christophe Lecoutre, Olivier Roussel. Cohérences basées sur les valeurs en échec. Cinquièmes Journées Francophones de Programmation par Contraintes, Jun 2009, Orléans, France. pp.355-365. ⟨hal-00387854⟩
  • Hachemi Bennaceur, Christophe Lecoutre, Olivier Roussel. A Decomposition Technique for Solving {Max-CSP}. 18th European Conference on Artificial Intelligence (ECAI'08), 2008, Patras, Greece. pp.500-504. ⟨hal-00865285⟩
  • Hachémi Bennaceur, Christophe Lecoutre, Olivier Roussel. Une technique de décomposition pour Max-CSP. JFPC 2008- Quatrièmes Journées Francophones de Programmation par Contraintes, LINA - Université de Nantes - Ecole des Mines de Nantes, Jun 2008, Nantes, France. pp.219-226. ⟨inria-00291628⟩
  • Hachemi Bennaceur, Christophe Lecoutre, Olivier Roussel. A decomposition strategy to reduce the search space of solutions of WCSP. 9th Workshop on Preferences and Soft Constraints (Soft'08), 2008, Sydney, Australia. pp.73-87. ⟨hal-00870842⟩
  • Olivier Roussel. Une autre conversion de SAT vers CSP. Premières Journées Francophones de Programmation par Contraintes, CRIL - CNRS FRE 2499, Jun 2005, Lens, France. pp.49-58. ⟨inria-00000045⟩
  • Olivier Roussel. Some notes on the implementation of csp2sat+zchaff, a simple translator from CSP to SAT. Second International Workshop on Constraint Propagation and Implementation(CPAI05), Oct 2005, Sitges, Spain. pp.83-88. ⟨hal-00460851⟩
  • Daniel Le Berre, Anne Parrain, Olivier Roussel. The long way from conflict driven clause learning to conflict driven constraint learning. Guangzhou Symposium on Satisfiability and its applications (Guangzhou04), 2004, Guangzhou, China. ⟨hal-03300804⟩
  • Gilles Audemard, Daniel Le Berre, Olivier Roussel, Ines Lynce, Joao Marques-Silva. OpenSAT: an open source SAT software project. Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT2003), 2003, Portofino, Italy. ⟨hal-03299485⟩
  • Gilles Audemard, Daniel Le Berre, Olivier Roussel. OpenSAT: une plateforme SAT Open Source. JNPC'03, 2003, Amiens, France. ⟨hal-03299519⟩
  • Philippe Mathieu, Olivier Roussel. Exact Knowledge Compilation in Predicate Calculus: the Partial Achievement Case. Proceedings of 14th International Conference on Automated Deduction (CADE'14), 1997, undef, France. pp.161--175. ⟨hal-00731972⟩
  • Olivier Roussel, Philippe Mathieu. Une compilation logique exacte en calcul des prédicats : le cas de l'achèvement total. Actes de la 3ème conférence nationale sur la résolution pratique de problèmes NP-complets (JNPC'97), 1997, undef, France. pp.61--66. ⟨hal-00732026⟩
  • Philippe Mathieu, Olivier Roussel. How to Use Cycles for Logicial Compilation. Proceedings of the European Conference on Artificial Intelligence's Workshop on Advances in Propositional Deduction (APD@ECAI'96), 1996, undef, France. pp.53--60. ⟨hal-00731984⟩
  • Olivier Roussel, Philippe Mathieu. A New Method for Knowledge Compilation: The Achievement by Cycle Search. Proceedings of the 13th International Conference on Automated Deduction (CADE'13), 1996, undef, France. pp.493--507. ⟨hal-00731971⟩
  • Philippe Mathieu, Olivier Roussel. Une nouvelle Methode de Compilation Logique : L'Achèvement par Cycles. Actes des Journées Francophones de Programmation Logique et Contraintes (JFPLC'96), 1996, undef, France. ⟨hal-00732014⟩
  • Olivier Roussel, Philippe Mathieu. Evaluation des méthodes d'achèvement par parties. Actes des Journées Francophones de Programmation Logique (JFPL'95), 1995, undef, France. pp.175--189. ⟨hal-00732012⟩

Book sections1 document

  • Vasco Manquinho, Olivier Roussel. Pseudo-Boolean and Cardinality Constraints. Armin Biere, Marijn Heule, Hans van Maaren and Toby Walsh. Handbook of Satisfiability,, IOS Press, pp.695-733, 2009, volume 2. ⟨hal-00870005⟩

Directions of work or proceedings2 documents

  • Marc-R.C. van Dongen, Christophe Lecoutre, Olivier Roussel. Proceedings of the 2nd International Constraint Solver Competition (2006). pas d'éditeur commercial, pp.96, 2008. ⟨hal-00872715⟩
  • Marc-R.C. van Dongen, Christophe Lecoutre, Olivier Roussel. Proceedings of the 3rd International Constraint Solver Competition (2008). pas d'éditeur commercial, pp.90, 2008. ⟨hal-00872713⟩

Reports3 documents

  • Frederic Boussemart, Fred Hemery, Christophe Lecoutre, Olivier Roussel, Sebastien Tabary. Optimization du montage de prets immobiliers : modelisation du probleme. [Rapport de recherche] Centre de Recherche en Informatique de Lens. 2012. ⟨hal-00872787⟩
  • Christophe Lecoutre, Olivier Roussel. XML Representation of Constraint Networks: Format XCSP 2.1. [Rapport de recherche] Centre de Recherche en Informatique de Lens. 2009. ⟨hal-00872825⟩
  • Christophe Lecoutre, Olivier Roussel, M. van Dongen. XML Representation of Constraint Networks: Format XCSP 2.0. [Technical Report] Centre de Recherche en Informatique de Lens. 2006. ⟨hal-03300938⟩