default search action
Gilles Audemard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c59]Thibault Falque, Gilles Audemard, Christophe Lecoutre, Bertrand Mazure:
Check-In Desk Scheduling Optimisation at CDG International Airport. AAAI 2024: 22743-22751 - [c58]Gilles Audemard, Sylvie Coste-Marquis, Pierre Marquis, Mehdi Sabiri, Nicolas Szczepanski:
Designing an XAI Interface for Tree-Based ML Models. ECAI 2024: 1075-1082 - [c57]Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis:
On the Computation of Contrastive Explanations for Boosted Regression Trees. ECAI 2024: 1083-1091 - [c56]Gilles Audemard, Sylvie Coste-Marquis, Pierre Marquis, Mehdi Sabiri:
Rectifier pour mieux distiller. EGC 2024: 59-70 - [c55]Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski:
On the Computation of Example-Based Abductive Explanations for Random Forests. IJCAI 2024: 3679-3687 - [c54]Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski:
Deriving Provably Correct Explanations for Decision Trees: The Impact of Domain Theories. IJCAI 2024: 3688-3696 - [c53]Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski:
PyXAI: An XAI Library for Tree-Based Models. IJCAI 2024: 8601-8605 - 2023
- [c52]Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski:
Computing Abductive Explanations for Boosted Trees. AISTATS 2023: 4699-4711 - [c51]Gilles Audemard, Christophe Lecoutre, Charles Prud'homme
:
Guiding Backtrack Search by Tracking Variables During Constraint Propagation. CP 2023: 9:1-9:17 - [c50]Gilles Audemard
On Contrastive Explanations for Tree-Based Classifiers. ECAI 2023: 117-124 - [c49]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: 507-514 - [c48]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: 581-588 - [c47]Gilles Audemard, Steve Bellart, Jean-Marie Lagniez, Pierre Marquis
Computing Abductive Explanations for Boosted Regression Trees. IJCAI 2023: 3432-3441 - [i8]Gilles Audemard, Christophe Lecoutre, Emmanuel Lonca:
Proceedings of the 2023 XCSP3 Competition. CoRR abs/2312.05877 (2023) - 2022
- [j6]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: 102088 (2022) - [c46]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: 5461-5469 - [c45]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: 123-134 - [c44]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: 147-158 - [c43]Gilles Audemard, Jean-Marie Lagniez, Marie Miceli, Olivier Roussel
Identifying Soft Cores in Propositional Formulæ. ICAART (2) 2022: 486-495 - [c42]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: 643-650 - [c41]Gilles Audemard, Jean-Marie Lagniez, Marie Miceli:
A New Exact Solver for (Weighted) Max#SAT. SAT 2022: 28:1-28:20 - [i7]Gilles Audemard, Christophe Lecoutre, Emmanuel Lonca:
Proceedings of the 2022 XCSP3 Competition. CoRR abs/2209.00917 (2022) - [i6]Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski:
Computing Abductive Explanations for Boosted Trees. CoRR abs/2209.07740 (2022) - 2021
- [c40]Nicolas Szczepanski, Gilles Audemard, Laetitia Jourdan
A hybrid CP/MOLS approach for multi-objective imbalanced classification. GECCO 2021: 723-731 - [c39]Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
On the Computational Intelligibility of Boolean Classifiers. KR 2021: 74-86 - [i5]Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis:
On the Computational Intelligibility of Boolean Classifiers. CoRR abs/2104.06172 (2021) - [i4]Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis:
On the Explanatory Power of Decision Trees. CoRR abs/2108.05266 (2021) - [i3]Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis:
Trading Complexity for Sparsity in Random Forest Explanations. CoRR abs/2108.05276 (2021) - 2020
- [j5]Gilles Audemard, Frédéric Boussemart, Christophe Lecoutre
XCSP3 and its ecosystem. Constraints An Int. J. 25(1-2): 47-69 (2020) - [c38]Gilles Audemard, Christophe Lecoutre, Mehdi Maamar:
Segmented Tables: An Efficient Modeling Tool for Constraint Reasoning. ECAI 2020: 315-322 - [c37]Gilles Audemard, Frédéric Koriche, Pierre Marquis:
On Tractable XAI Queries based on Compiled Representations. KR 2020: 838-849 - [c36]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: 107-113 - [i2]Gilles Audemard, Loïc Paulevé, Laurent Simon:
SAT Heritage: a community-driven effort for archiving, building and running more than thousand SAT solvers. CoRR abs/2006.01503 (2020) - [i1]Frédéric Boussemart, Christophe Lecoutre, Gilles Audemard, Cédric Piette:
XCSP3-core: A Format for Representing Constraint Satisfaction/Optimization Problems. CoRR abs/2009.00514 (2020)
2010 – 2019
- 2018
- [j4]Gilles Audemard, Laurent Simon:
On the Glucose SAT Solver. Int. J. Artif. Intell. Tools 27(1): 1840001:1-1840001:25 (2018) - 2017
- [c35]Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary:
A Distributed Version of Syrup. SAT 2017: 215-232 - 2016
- [c34]Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary:
An Adaptive Parallel SAT Solver. CP 2016: 30-48 - [c33]Gilles Audemard, Laurent Simon:
Extreme Cases in SAT Problems. SAT 2016: 87-103 - 2014
- [j3]Gilles Audemard, Armin Biere
Améliorer SAT dans le cadre incrémental. Rev. d'Intelligence Artif. 28(5): 593-614 (2014) - [c32]Gilles Audemard, Christophe Lecoutre, Mouny Samy Modeliar, Gilles Goncalves
Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem. CP 2014: 125-141 - [c31]Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Cédric Piette:
An Effective Distributed D&C Approach for the Satisfiability Problem. PDP 2014: 183-187 - [c30]Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Cédric Piette:
Dolius: A Distributed Parallel SAT Solving Framework. POS@SAT 2014: 1-11 - [c29]Gilles Audemard, Laurent Simon:
Lazy Clause Exchange Policy for Parallel SAT Solvers. SAT 2014: 197-205 - [c28]Zack Newsham, Vijay Ganesh
Impact of Community Structure on SAT Solver Performance. SAT 2014: 252-268 - 2013
- [c27]Gilles Audemard, Jean-Marie Lagniez, Laurent Simon:
Just-In-Time Compilation of Knowledge Bases. IJCAI 2013: 447-453 - [c26]Gilles Audemard, Jean-Marie Lagniez, Laurent Simon:
Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction. SAT 2013: 309-317 - 2012
- [c25]Gilles Audemard, Laurent Simon:
Refining Restarts Strategies for SAT and UNSAT. CP 2012: 118-126 - [c24]Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Jean-Marie Lagniez, Cédric Piette:
Revisiting Clause Exchange in Parallel SAT Solving. SAT 2012: 200-213 - 2011
- [c23]Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais:
On Freezing and Reactivating Learnt Clauses. SAT 2011: 188-200 - 2010
- [c22]Gilles Audemard, George Katsirelos, Laurent Simon:
A Restriction of Extended Resolution for Clause Learning SAT Solvers. AAAI 2010: 15-20 - [c21]Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais:
Boosting Local Search Thanks to cdcl. LPAR (Yogyakarta) 2010: 474-488
2000 – 2009
- 2009
- [c20]Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais:
Learning in Local Search. ICTAI 2009: 417-424 - [c19]Gilles Audemard, Laurent Simon:
Predicting Learnt Clauses Quality in Modern SAT Solvers. IJCAI 2009: 399-404 - [c18]Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais:
Integrating Conflict Driven Clause Learning to Local Search. LSCS 2009: 55-68 - 2008
- [j2]Gilles Audemard, Saïd Jabbour, Lakhdar Sais:
SAT graph-based representation: A new perspective. J. Algorithms 63(1-3): 17-33 (2008) - [c17]Gilles Audemard, Laurent Simon:
Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms. CP 2008: 630-634 - [c16]Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
A Generalized Framework for Conflict Analysis. SAT 2008: 21-27 - 2007
- [c15]Gilles Audemard, Laurent Simon:
GUNSAT: A Greedy Local Search Algorithm for Unsatisfiability. IJCAI 2007: 2256-2261 - [c14]Gilles Audemard, Saïd Jabbour, Lakhdar Sais:
Symmetry Breaking in Quantified Boolean Formulae. IJCAI 2007: 2262-2267 - [c13]Gilles Audemard, Lakhdar Sais:
Circuit Based Encoding of CNF Formula. SAT 2007: 16-21 - 2006
- [j1]Gilles Audemard, Belaid Benhamou, Laurent Henocque:
Predicting and Detecting Symmetries in FOL Finite Model Search. J. Autom. Reason. 36(3): 177-212 (2006) - 2005
- [c12]Gilles Audemard, Lakhdar Sais:
A Symbolic Search Based Approach for Quantified Boolean Formulas. SAT 2005: 16-30 - 2004
- [c11]Gilles Audemard, Lakhdar Sais:
SAT Based BDD Solver for Quantified Boolean Formulas. ICTAI 2004: 82-89 - [c10]Gilles Audemard, Bertrand Mazure, Lakhdar Sais:
Dealing with Symmetries in Quantified Boolean Formulas. SAT 2004 - [c9]Gilles Audemard, Marco Bozzano
Verifying Industrial Hybrid Systems with MathSAT. BMC@CAV 2004: 17-32 - 2002
- [c8]Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti
Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements. AISC 2002: 231-245 - [c7]Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions. CADE 2002: 195-210 - [c6]Gilles Audemard, Belaid Benhamou:
Reasoning by Symmetry and Function Ordering in Finite Model Generation. CADE 2002: 226-240 - [c5]Gilles Audemard, Alessandro Cimatti
Bounded Model Checking for Timed Systems. FORTE 2002: 243-259 - 2001
- [c4]Gilles Audemard, Laurent Henocque:
The eXtended Least Number Heuristic. IJCAR 2001: 427-442 - [c3]Gilles Audemard, Belaid Benhamou:
Etude des symétries dans les modèles finis. JFPLC 2001: 109-122 - 2000
- [c2]Gilles Audemard, Belaid Benhamou, Laurent Henocque:
Two Techniques to Improve Finite Model Search. CADE 2000: 302-308 - [c1]Gilles Audemard, Belaid Benhamou, Pierre Siegel:
AVAL: An Enumerative Method for SAT. Computational Logic 2000: 373-383
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: