Gilles Audemard

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 32

Top Topics

Constraint Satisfaction

Propositional Satisfiability

Top Venues

Publications

Thibault Falque, Gilles Audemard, Christophe Lecoutre, Bertrand Mazure
Check-In Desk Scheduling Optimisation at CDG International Airport. AAAI (2024)
Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski
On Contrastive Explanations for Tree-Based Classifiers. ECAI (2023)
Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
Sur les explications abductives préférées pour les arbres de décision et les forêts aléatoires. EGC (2023)
Gilles Audemard, Steve Bellart, Jean-Marie Lagniez, Pierre Marquis
Computing Abductive Explanations for Boosted Regression Trees. IJCAI (2023)
Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski
Computing Abductive Explanations for Boosted Trees. AISTATS (2023)
Gilles Audemard, Steve Bellart, Louenas Bounia, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski
PyXAI : calculer en Python des explications pour des modèles d'apprentissage supervisé. EGC (2023)
Gilles Audemard, Christophe Lecoutre, Emmanuel Lonca
Proceedings of the 2023 XCSP3 Competition. CoRR (2023)
Gilles Audemard, Christophe Lecoutre, Charles Prud'homme
Guiding Backtrack Search by Tracking Variables During Constraint Propagation. CP (2023)
Gilles Audemard, Christophe Lecoutre, Emmanuel Lonca
Proceedings of the 2022 XCSP3 Competition. CoRR (2022)
Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski
Computing Abductive Explanations for Boosted Trees. CoRR (2022)
Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
Trading Complexity for Sparsity in Random Forest Explanations. AAAI (2022)
Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
Sur le pouvoir explicatif des arbres de décision. EGC (2022)
Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
On Preferred Abductive Explanations for Decision Trees and Random Forests. IJCAI (2022)
Gilles Audemard, Jean-Marie Lagniez, Marie Miceli, Olivier Roussel
Identifying Soft Cores in Propositional Formulæ. ICAART (2) (2022)
Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
Les raisons majoritaires : des explications abductives pour les forêts aléatoires. EGC (2022)
Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
On the explanatory power of Boolean decision trees. Data Knowl. Eng. 142 (2022)
Gilles Audemard, Jean-Marie Lagniez, Marie Miceli
A New Exact Solver for (Weighted) Max#SAT. SAT (2022)
Nicolas Szczepanski, Gilles Audemard, Laetitia Jourdan, Christophe Lecoutre, Lucien Mousin, Nadarajen Veerapen
A hybrid CP/MOLS approach for multi-objective imbalanced classification. GECCO (2021)
Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
On the Computational Intelligibility of Boolean Classifiers. KR (2021)
Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
On the Computational Intelligibility of Boolean Classifiers. CoRR (2021)
Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
On the Explanatory Power of Decision Trees. CoRR (2021)
Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
Trading Complexity for Sparsity in Random Forest Explanations. CoRR (2021)
Frédéric Boussemart, Christophe Lecoutre, Gilles Audemard, Cédric Piette
XCSP3-core: A Format for Representing Constraint Satisfaction/Optimization Problems. CoRR (2020)
Gilles Audemard, Frédéric Boussemart, Christophe Lecoutre, Cédric Piette, Olivier Roussel
and its ecosystem. Constraints An Int. J. 25 (1-2) (2020)
Gilles Audemard, Loïc Paulevé, Laurent Simon
SAT Heritage: A Community-Driven Effort for Archiving, Building and Running More Than Thousand SAT Solvers. SAT (2020)
Gilles Audemard, Loïc Paulevé, Laurent Simon
SAT Heritage: a community-driven effort for archiving, building and running more than thousand SAT solvers. CoRR (2020)
Gilles Audemard, Frédéric Koriche, Pierre Marquis
On Tractable XAI Queries based on Compiled Representations. KR (2020)
Gilles Audemard, Christophe Lecoutre, Mehdi Maamar
Segmented Tables: An Efficient Modeling Tool for Constraint Reasoning. ECAI (2020)
Gilles Audemard, Laurent Simon
On the Glucose SAT Solver. Int. J. Artif. Intell. Tools 27 (1) (2018)
Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary
A Distributed Version of Syrup. SAT (2017)
Gilles Audemard, Laurent Simon
Extreme Cases in SAT Problems. SAT (2016)
Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary
An Adaptive Parallel SAT Solver. CP (2016)
Gilles Audemard, Laurent Simon
Lazy Clause Exchange Policy for Parallel SAT Solvers. SAT (2014)
Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Cédric Piette
An Effective Distributed D&C Approach for the Satisfiability Problem. PDP (2014)
Zack Newsham, Vijay Ganesh, Sebastian Fischmeister, Gilles Audemard, Laurent Simon
Impact of Community Structure on SAT Solver Performance. SAT (2014)
Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Cédric Piette
Dolius: A Distributed Parallel SAT Solving Framework. POS@SAT (2014)
Gilles Audemard, Armin Biere, Jean-Marie Lagniez, Laurent Simon
Améliorer SAT dans le cadre incrémental. Rev. d'Intelligence Artif. 28 (5) (2014)
Gilles Audemard, Christophe Lecoutre, Mouny Samy Modeliar, Gilles Goncalves, Daniel Cosmin Porumbel
Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem. CP (2014)
Gilles Audemard, Jean-Marie Lagniez, Laurent Simon
Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction. SAT (2013)
Gilles Audemard, Jean-Marie Lagniez, Laurent Simon
Just-In-Time Compilation of Knowledge Bases. IJCAI (2013)
Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Jean-Marie Lagniez, Cédric Piette
Revisiting Clause Exchange in Parallel SAT Solving. SAT (2012)
Gilles Audemard, Laurent Simon
Refining Restarts Strategies for SAT and UNSAT. CP (2012)
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais
On Freezing and Reactivating Learnt Clauses. SAT (2011)
Gilles Audemard, George Katsirelos, Laurent Simon
A Restriction of Extended Resolution for Clause Learning SAT Solvers. AAAI (2010)
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais
Boosting Local Search Thanks to cdcl. LPAR (Yogyakarta) (2010)
Gilles Audemard, Laurent Simon
Predicting Learnt Clauses Quality in Modern SAT Solvers. IJCAI (2009)
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais
Learning in Local Search. ICTAI (2009)
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais
Integrating Conflict Driven Clause Learning to Local Search LSCS (2009)
Gilles Audemard, Laurent Simon
Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms. CP (2008)
Gilles Audemard, Saïd Jabbour, Lakhdar Sais
SAT graph-based representation: A new perspective. J. Algorithms 63 (1-3) (2008)
Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saïd Jabbour, Lakhdar Sais
A Generalized Framework for Conflict Analysis. SAT (2008)
Gilles Audemard, Laurent Simon
GUNSAT: A Greedy Local Search Algorithm for Unsatisfiability. IJCAI (2007)
Gilles Audemard, Lakhdar Sais
Circuit Based Encoding of CNF Formula. SAT (2007)
Gilles Audemard, Saïd Jabbour, Lakhdar Sais
Symmetry Breaking in Quantified Boolean Formulae. IJCAI (2007)
Gilles Audemard, Belaid Benhamou, Laurent Henocque
Predicting and Detecting Symmetries in FOL Finite Model Search. J. Autom. Reason. 36 (3) (2006)
Gilles Audemard, Lakhdar Sais
A Symbolic Search Based Approach for Quantified Boolean Formulas. SAT (2005)
Gilles Audemard, Marco Bozzano, Alessandro Cimatti, Roberto Sebastiani
Verifying Industrial Hybrid Systems with MathSAT. Electron. Notes Theor. Comput. Sci. 119 (2) (2005)
Gilles Audemard, Lakhdar Sais
SAT Based BDD Solver for Quantified Boolean Formulas. ICTAI (2004)
Gilles Audemard, Bertrand Mazure, Lakhdar Sais
Dealing with Symmetries in Quantified Boolean Formulas. SAT (2004)
Gilles Audemard, Belaid Benhamou
Reasoning by Symmetry and Function Ordering in Finite Model Generation. CADE (2002)
Gilles Audemard, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani
Bounded Model Checking for Timed Systems. FORTE (2002)
Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani
Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements. AISC (2002)
Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions. CADE (2002)
Gilles Audemard, Laurent Henocque
The eXtended Least Number Heuristic. IJCAR (2001)
Gilles Audemard, Belaid Benhamou
Etude des symétries dans les modèles finis. JFPLC (2001)
Gilles Audemard, Belaid Benhamou, Pierre Siegel
AVAL: An Enumerative Method for SAT. Computational Logic (2000)
Gilles Audemard, Belaid Benhamou, Laurent Henocque
Two Techniques to Improve Finite Model Search. CADE (2000)