Gilles Audemard
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
51
Venues
15
Active years
2000–2026
Best venue rank
A*
Where they publish
Papers
51 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | KR | A Rectification-Based Approach for Distilling Boosted Trees into Decision Trees. | Gilles Audemard, Sylvie Coste-Marquis, Pierre Marquis, Mehdi Sabiri, Nicolas Szczepanski |
| 2024 | AAAI | Check-In Desk Scheduling Optimisation at CDG International Airport. | Thibault Falque, Gilles Audemard, Christophe Lecoutre, Bertrand Mazure |
| 2024 | ECAI | Designing an XAI Interface for Tree-Based ML Models. | Gilles Audemard, Sylvie Coste-Marquis, Pierre Marquis, Mehdi Sabiri, Nicolas Szczepanski |
| 2024 | ECAI | On the Computation of Contrastive Explanations for Boosted Regression Trees. | Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis |
| 2024 | IJCAI | On the Computation of Example-Based Abductive Explanations for Random Forests. | Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski |
| 2024 | IJCAI | Deriving Provably Correct Explanations for Decision Trees: The Impact of Domain Theories. | Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski |
| 2024 | IJCAI | PyXAI: An XAI Library for Tree-Based Models. | Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski |
| 2023 | AISTATS | Computing Abductive Explanations for Boosted Trees. | Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski |
| 2023 | CP | Guiding Backtrack Search by Tracking Variables During Constraint Propagation. | Gilles Audemard, Christophe Lecoutre, Charles Prud'homme |
| 2023 | ECAI | On Contrastive Explanations for Tree-Based Classifiers. | Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski |
| 2023 | IJCAI | Computing Abductive Explanations for Boosted Regression Trees. | Gilles Audemard, Steve Bellart, Jean-Marie Lagniez, Pierre Marquis |
| 2022 | AAAI | Trading Complexity for Sparsity in Random Forest Explanations. | Gilles Audemard, Steve Bellart, Louenas Bounia, Frdric Koriche, Jean-Marie Lagniez, Pierre Marquis |
| 2022 | ICAART | Identifying Soft Cores in Propositional Formul. | Gilles Audemard, Jean-Marie Lagniez, Marie Miceli, Olivier Roussel |
| 2022 | IJCAI | On Preferred Abductive Explanations for Decision Trees and Random Forests. | Gilles Audemard, Steve Bellart, Louenas Bounia, Frdric Koriche, Jean-Marie Lagniez, Pierre Marquis |
| 2022 | SAT | A New Exact Solver for (Weighted) Max#SAT. | Gilles Audemard, Jean-Marie Lagniez, Marie Miceli |
| 2021 | GECCO | A hybrid CP/MOLS approach for multi-objective imbalanced classification. | Nicolas Szczepanski, Gilles Audemard, Laetitia Jourdan, Christophe Lecoutre, Lucien Mousin, Nadarajen Veerapen |
| 2021 | KR | On the Computational Intelligibility of Boolean Classifiers. | Gilles Audemard, Steve Bellart, Louenas Bounia, Frdric Koriche, Jean-Marie Lagniez, Pierre Marquis |
| 2020 | ECAI | Segmented Tables: An Efficient Modeling Tool for Constraint Reasoning. | Gilles Audemard, Christophe Lecoutre, Mehdi Maamar |
| 2020 | KR | On Tractable XAI Queries based on Compiled Representations. | Gilles Audemard, Frdric Koriche, Pierre Marquis |
| 2020 | SAT | SAT Heritage: A Community-Driven Effort for Archiving, Building and Running More Than Thousand SAT Solvers. | Gilles Audemard, Loc Paulev, Laurent Simon |
| 2017 | SAT | A Distributed Version of Syrup. | Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sbastien Tabary |
| 2016 | CP | An Adaptive Parallel SAT Solver. | Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sbastien Tabary |
| 2016 | SAT | Extreme Cases in SAT Problems. | Gilles Audemard, Laurent Simon |
| 2014 | CP | Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem. | Gilles Audemard, Christophe Lecoutre, Mouny Samy Modeliar, Gilles Goncalves, Daniel Cosmin Porumbel |
| 2014 | PDP | An Effective Distributed D&C Approach for the Satisfiability Problem. | Gilles Audemard, Benot Hoessen, Sad Jabbour, Cdric Piette |
| 2014 | SAT | Dolius: A Distributed Parallel SAT Solving Framework. | Gilles Audemard, Benot Hoessen, Sad Jabbour, Cdric Piette |
| 2014 | SAT | Lazy Clause Exchange Policy for Parallel SAT Solvers. | Gilles Audemard, Laurent Simon |
| 2014 | SAT | Impact of Community Structure on SAT Solver Performance. | Zack Newsham, Vijay Ganesh, Sebastian Fischmeister, Gilles Audemard, Laurent Simon |
| 2013 | IJCAI | Just-In-Time Compilation of Knowledge Bases. | Gilles Audemard, Jean-Marie Lagniez, Laurent Simon |
| 2013 | SAT | Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction. | Gilles Audemard, Jean-Marie Lagniez, Laurent Simon |
| 2012 | CP | Refining Restarts Strategies for SAT and UNSAT. | Gilles Audemard, Laurent Simon |
| 2012 | SAT | Revisiting Clause Exchange in Parallel SAT Solving. | Gilles Audemard, Benot Hoessen, Sad Jabbour, Jean-Marie Lagniez, Cdric Piette |
| 2011 | SAT | On Freezing and Reactivating Learnt Clauses. | Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais |
| 2010 | AAAI | A Restriction of Extended Resolution for Clause Learning SAT Solvers. | Gilles Audemard, George Katsirelos, Laurent Simon |
| 2010 | LPAR | Boosting Local Search Thanks to cdcl. | Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais |
| 2009 | IJCAI | Predicting Learnt Clauses Quality in Modern SAT Solvers. | Gilles Audemard, Laurent Simon |
| 2009 | ICTAI | Learning in Local Search. | Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais |
| 2008 | CP | Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms. | Gilles Audemard, Laurent Simon |
| 2008 | SAT | A Generalized Framework for Conflict Analysis. | Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Sad Jabbour, Lakhdar Sais |
| 2007 | IJCAI | Symmetry Breaking in Quantified Boolean Formulae. | Gilles Audemard, Sad Jabbour, Lakhdar Sais |
| 2007 | IJCAI | GUNSAT: A Greedy Local Search Algorithm for Unsatisfiability. | Gilles Audemard, Laurent Simon |
| 2007 | SAT | Circuit Based Encoding of CNF Formula. | Gilles Audemard, Lakhdar Sais |
| 2005 | SAT | A Symbolic Search Based Approach for Quantified Boolean Formulas. | Gilles Audemard, Lakhdar Sais |
| 2004 | ICTAI | SAT Based BDD Solver for Quantified Boolean Formulas. | Gilles Audemard, Lakhdar Sais |
| 2004 | SAT | Dealing with Symmetries in Quantified Boolean Formulas. | Gilles Audemard, Bertrand Mazure, Lakhdar Sais |
| 2002 | AISC | Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements. | Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani |
| 2002 | CADE | Reasoning by Symmetry and Function Ordering in Finite Model Generation. | Gilles Audemard, Belaid Benhamou |
| 2002 | CADE | A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions. | Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani |
| 2002 | FORTE | Bounded Model Checking for Timed Systems. | Gilles Audemard, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani |
| 2001 | CADE | The eXtended Least Number Heuristic. | Gilles Audemard, Laurent Henocque |
| 2000 | CADE | Two Techniques to Improve Finite Model Search. | Gilles Audemard, Belaid Benhamou, Laurent Henocque |