| * | 2009 |
| 15 | EE | Christophe Lecoutre,
Olivier Roussel:
Failed Value Consistencies for Constraint Satisfaction.
CP 2009: 554-568 |
| 14 | EE | Olivier Bailleux,
Yacine Boufkhad,
Olivier Roussel:
New Encodings of Pseudo-Boolean Constraints into CNF.
SAT 2009: 181-194 |
| 13 | EE | Olivier Roussel,
Vasco M. Manquinho:
Pseudo-Boolean and Cardinality Constraints.
Handbook of Satisfiability 2009: 695-733 |
| 12 | EE | Olivier Roussel,
Christophe Lecoutre:
XML Representation of Constraint Networks: Format XCSP 2.1
CoRR abs/0902.2362: (2009) |
| 2008 |
| 11 | EE | Hachemi Bennaceur,
Christophe Lecoutre,
Olivier Roussel:
A Decomposition Technique for Max-CSP.
ECAI 2008: 500-504 |
| 2006 |
| 10 | EE | Vasco M. Manquinho,
Olivier Roussel:
The First Evaluation of Pseudo-Boolean Solvers (PB'05).
JSAT 2(1-4): 103-143 (2006) |
| 9 | EE | Olivier Bailleux,
Yacine Boufkhad,
Olivier Roussel:
A Translation of Pseudo Boolean Constraints to SAT.
JSAT 2(1-4): 191-200 (2006) |
| 2004 |
| 8 | EE | Olivier Roussel:
Another SAT to CSP Conversion.
ICTAI 2004: 558-565 |
| 2000 |
| 7 | | Yacine Boufkhad,
Olivier Roussel:
Redundancy in Random SAT Formulas.
AAAI/IAAI 2000: 273-278 |
| 6 | | Olivier Roussel,
Philippe Mathieu:
The Achievement of Knowledge Bases by Cycle Search.
Inf. Comput. 162(1-2): 43-58 (2000) |
| 1997 |
| 5 | EE | Olivier Roussel,
Philippe Mathieu:
Exact Kanowledge Compilation in Predicate Calculus: The Partial Achievement Case.
CADE 1997: 161-175 |
| 4 | | Olivier Roussel,
Philippe Mathieu:
Une compilation logique exacte en calcul des prédicats: le cas de l'achèvement partiel.
JFPLC 1997: 261-276 |
| 1996 |
| 3 | EE | Olivier Roussel,
Philippe Mathieu:
A New Method for Knowledge Compilation: The Achievement by Cycle Search.
CADE 1996: 493-507 |
| 2 | | Olivier Roussel,
Philippe Mathieu:
Une nouvelle méthode de compilation logique: l'achèvement par cycles.
JFPLC 1996: 271-286 |
| 1995 |
| 1 | | Olivier Roussel,
Philippe Mathieu:
Évaluation des méthodes d'achèvement par parties.
JFPLC 1995: 175-189 |