| Tabu search for SAT B Mazure, L Sais, É Grégoire Proceedings of the fourteenth national conference on artificial intelligence …, 1997 | 234 | 1997 |
| Boosting complete techniques thanks to local search methods B Mazure, L Sais, É Grégoire Annals of mathematics and artificial intelligence 22, 319-331, 1998 | 159 | 1998 |
| Recovering and exploiting structural knowledge from CNF formulas R Ostrowski, É Grégoire, B Mazure, L Sais Principles and Practice of Constraint Programming-CP 2002: 8th International …, 2002 | 155 | 2002 |
| On freezing and reactivating learnt clauses G Audemard, JM Lagniez, B Mazure, L Sais Theory and Applications of Satisfiability Testing-SAT 2011: 14th …, 2011 | 94 | 2011 |
| Automatic extraction of functional dependencies É Grégoire, R Ostrowski, B Mazure, L Sais Theory and Applications of Satisfiability Testing: 7th International …, 2005 | 72 | 2005 |
| Local-search extraction of MUSes É Grégoire, B Mazure, C Piette Constraints 12, 325-344, 2007 | 71 | 2007 |
| Boosting a Complete Technique to Find MSS and MUS Thanks to a Local Search Oracle. E Grégoire, B Mazure, C Piette IJCAI 7, 2300-2305, 2007 | 68 | 2007 |
| Extracting muses E Gregoire, B Mazure, C Piette ECAI 6, 387-391, 2006 | 60 | 2006 |
| An experimentally efficient method for (MSS, CoMSS) partitioning É Grégoire, JM Lagniez, B Mazure Proceedings of the AAAI Conference on Artificial Intelligence 28 (1), 2014 | 52 | 2014 |
| Using local search to find MSSes and MUSes É Grégoire, B Mazure, C Piette European Journal of Operational Research 199 (3), 640-646, 2009 | 49 | 2009 |
| Computing prime implicants D Déharbe, P Fontaine, D Le Berre, B Mazure 2013 Formal Methods in Computer-Aided Design, 46-52, 2013 | 45 | 2013 |
| On approaches to explaining infeasibility of sets of Boolean clauses É Grégoire, B Mazure, C Piette 2008 20th IEEE International Conference on Tools with Artificial …, 2008 | 43 | 2008 |
| Boosting Local Search Thanks to cdcl G Audemard, JM Lagniez, B Mazure, L Sais Logic for Programming, Artificial Intelligence, and Reasoning: 17th …, 2010 | 39 | 2010 |
| Tractable cover compilations Y Boufkhad, E Gregoire, P Marquis, B Mazure, L Sais IJCAI (1), 122-127, 1997 | 39 | 1997 |
| ASTERYX: A model-Agnostic SaT-basEd appRoach for sYmbolic and score-based eXplanations R Boumazouza, F Cheikh-Alili, B Mazure, K Tabia Proceedings of the 30th ACM International Conference on Information …, 2021 | 35 | 2021 |
| Eliminating redundant clauses in SAT instances O Fourdrinoy, É Grégoire, B Mazure, L Sais International Conference on Integration of Artificial Intelligence (AI) and …, 2007 | 34 | 2007 |
| MUST: Provide a finer-grained explanation of unsatisfiability É Grégoire, B Mazure, C Piette Principles and Practice of Constraint Programming–CP 2007: 13th …, 2007 | 29 | 2007 |
| Tracking MUSes and strict inconsistent covers E Gregoire, B Mazure, C Piette 2006 Formal Methods in Computer Aided Design, 39-46, 2006 | 27 | 2006 |
| On finding minimally unsatisfiable cores of CSPs E Grégoire, B Mazure, C Piette International Journal on Artificial Intelligence Tools 17 (04), 745-763, 2008 | 25 | 2008 |
| Using Boolean constraint propagation for sub-clauses deduction S Darras, G Dequen, L Devendeville, B Mazure, R Ostrowski, L Sais Principles and Practice of Constraint Programming-CP 2005: 11th …, 2005 | 24 | 2005 |
Pr. Lakhdar SaisCRIL - CNRS, Université d'ArtoisAdresse e-mail validée de cril.fr
