Search the dblp DataBase

Publications of Author

1. Yacine Boufkhad, Olivier Roussel
   Redundancy in Random SAT Formulas. [Citation Graph (0, 0)][DBLP]
   AAAI/IAAI, 2000, pp:273-278 [Conf]
   
2. Olivier Roussel, Philippe Mathieu
   A New Method for Knowledge Compilation: The Achievement by Cycle Search. [Citation Graph (0, 0)][DBLP]
   CADE, 1996, pp:493-507 [Conf]
   
3. Olivier Roussel, Philippe Mathieu
   Exact Kanowledge Compilation in Predicate Calculus: The Partial Achievement Case. [Citation Graph (0, 0)][DBLP]
   CADE, 1997, pp:161-175 [Conf]
   
4. Olivier Roussel
   Another SAT to CSP Conversion. [Citation Graph (0, 0)][DBLP]
   ICTAI, 2004, pp:558-565 [Conf]
   
5. Olivier Roussel, Philippe Mathieu
   Évaluation des méthodes d'achèvement par parties. [Citation Graph (0, 0)][DBLP]
   JFPLC, 1995, pp:175-189 [Conf]
   
6. Olivier Roussel, Philippe Mathieu
   Une nouvelle méthode de compilation logique: l'achèvement par cycles. [Citation Graph (0, 0)][DBLP]
   JFPLC, 1996, pp:271-286 [Conf]
   
7. Olivier Roussel, Philippe Mathieu
   Une compilation logique exacte en calcul des prédicats: le cas de l'achèvement partiel. [Citation Graph (0, 0)][DBLP]
   JFPLC, 1997, pp:261-276 [Conf]
   
8. Olivier Roussel, Philippe Mathieu
   The Achievement of Knowledge Bases by Cycle Search. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2000, v:162, n:1-2, pp:43-58 [Journal]
   
9. 
   Failed Value Consistencies for Constraint Satisfaction. [Citation Graph (, )][DBLP]
   
   
10. 
    A Decomposition Technique for Max-CSP. [Citation Graph (, )][DBLP]
    
    
11. 
    New Encodings of Pseudo-Boolean Constraints into CNF. [Citation Graph (, )][DBLP]
    
    
12. 
    XML Representation of Constraint Networks: Format XCSP 2.1 [Citation Graph (, )][DBLP]