Остановите войну!
for scientists:
default search action
Gilles Audemard
- > Home > Persons > Gilles Audemard
Publications
- 2023
- [c52]Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski:
Computing Abductive Explanations for Boosted Trees. AISTATS 2023: 4699-4711 - [c50]Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski:
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 - 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 - [i6]Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski:
Computing Abductive Explanations for Boosted Trees. CoRR abs/2209.07740 (2022) - 2021
- [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) - 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 - 2014
- [j3]Gilles Audemard, Armin Biere, Jean-Marie Lagniez, Laurent Simon:
Améliorer SAT dans le cadre incrémental. Rev. d'Intelligence Artif. 28(5): 593-614 (2014) - 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
- [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
- [c21]Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais:
Boosting Local Search Thanks to cdcl. LPAR (Yogyakarta) 2010: 474-488 - 2009
- [c20]Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais:
Learning in Local Search. ICTAI 2009: 417-424 - [c18]Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais:
Integrating Conflict Driven Clause Learning to Local Search. LSCS 2009: 55-68
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-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint