Biblio
] , “Diagnostic Distribué à base de modèles sans calcul préalable des conflits”, in Actes des Journées Francophones de Programmation par Contraintes (JFPC), 2008, pp. 41–48.
, “Distributed Consistency-Based Diagnosis”, in Proc. of International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), Doha, Qatar, 2008.
, “Distributed Consistency-Based Diagnosis without Conflicts”, in Proc. of International Workshop on Principles of Diagnosis (DX), 2008.
, “Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms”, in Proc. of International Conference on Principles and Practice of Constraint Programming (CP), 2008.
, “SAT: Progrès et Défis”, Hermes, 2008.
, “Pourquoi les solveurs SAT modernes se piquent-ils contre des cactus?”, in Actes des Journées Francophones de Programmation par Contraintes (JFPC), Orléans, France, 2009, pp. 245-255.
, “Predicting Learnt Clauses Quality in Modern SAT Solver”, in Proc. of International Joint Conference on Artificial Intelligence (IJCAI), Pasadena, États-Unis d'Amérique, 2009.
, “Logique propositionnelle : un langage simple, des problèmes complexes”, Université Paris Sud, 2010.
, “A Restriction of Extended Resolution for Clause Learning SAT Solvers”, in Proc. of American Association of Artificial Intelligence Conference (AAAI), Atlanta United States, 2010.
, “Une restriction de la résolution étendue pour les démonstrateurs SAT modernes”, in Actes des Journées Francophones de Programmation par Contraintes (JFPC), Orléans France, 2010.
, “Minimum Satisfiability and its Applications”, in Proc. of International Joint Conference on Artificial Intelligence (IJCAI), Barcelona, Spain, 2011.
, “Satisfiabilité Minimale et Applications”, in Actes des Journées Francophones de Programmation par Contraintes (JFPC), Lyon, France, 2011.
, “Distributed Tree Decomposition by Local Elections with One Token”, in Actes des Journées de l'Intelligence Artificielle Fondamentale, (JIAF), Toulouse, France, 2012.
, “Distributed tree decomposition with privacy”, in Proc. of International Conference on Principles and Practice of Constraint Programming (CP), Québec, Canada, 2012, pp. 102-117.
, “Eigenvector centrality in industrial SAT instances”, in Proc. of International Conference on Principles and Practice of Constraint Programming (CP), Québec City, Canada, 2012, pp. 348-356.
, “Glucose 2.1: Aggressive - but Reactive - Clause Database Management, Dynamic Restarts”, in Proc. of International Workshop of Pragmatics of SAT (Affiliated to SAT), Trento, Italie, 2012.
, “The International SAT Solver Competition”, Artificial Intelligence Magazine, vol. 33, 2012.
, “Learning Polynomials over GF(2) in a SAT Solver”, in Proc. of International Conference on Theory and Applications of Satisfiability Testing (SAT), Trento, Italie, 2012.
, “Optimizing with Minimum Satisfiability”, Artificial Intelligence, vol. 190, pp. 32-44, 2012.
, “Refining restarts strategies for SAT and UNSAT formulae”, in Proc. of International Conference on Principles and Practice of Constraint Programming (CP), Québec City, Canada, 2012, pp. 118-126.
, “Du Glucose en goutte à goutte pour les coeurs inconsistants”, in Actes des Journées Francophones de Programmation par Contraintes (JFPC), Aix en Provence, France, 2013.
, “Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction”, in Proc. of International Conference on Theory and Applications of Satisfiability Testing (SAT), Helsinki, Finlande, 2013.
, “Just-in-Time Compilation of Knowledge Bases”, in International Joint Conference on Artificial Intelligence (IJCAI), Pékin, Chine, 2013.
, “Resolution and Parallelizability: Barriers to the Efficient Parallelisation of SAT Solvers”, in Conference on Artificial Intelligence (AAAI), Washington, Etats-Unis, 2013.
, “Diagnosability Planning for Controllable Discrete Event Systems”, in {27th International Workshop on Principles of Diagnosis DX'16}, Denver, United States, 2016.