default search action
Jean-Marie Lagniez
Person information
- affiliation: Université d'Artois, Lens, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c76]Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly:
A SAT-based Approach for Argumentation Dynamics. AAMAS 2024: 2351-2353 - [c75]Frédéric Koriche, Jean-Marie Lagniez, Stefan Mengel, Chi Tran:
Learning Model Agnostic Explanations via Constraint Programming. ECML/PKDD (4) 2024: 437-453 - [c74]Jean-Marie Lagniez, Pierre Marquis, Armin Biere:
Dynamic Blocked Clause Elimination for Projected Model Counting. SAT 2024: 21:1-21:17 - [i8]Jean-Marie Lagniez, Pierre Marquis, Armin Biere:
Dynamic Blocked Clause Elimination for Projected Model Counting. CoRR abs/2408.06199 (2024) - 2023
- [j12]Nicolas Schwind
, Emir Demirovic, Katsumi Inoue, Jean-Marie Lagniez:
Algorithms for partially robust team formation. Auton. Agents Multi Agent Syst. 37(2): 22 (2023) - [c73]Gilles Audemard, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski:
Computing Abductive Explanations for Boosted Trees. AISTATS 2023: 4699-4711 - [c72]Sara Riva, Jean-Marie Lagniez, Gustavo Magaña López, Loïc Paulevé:
Tackling Universal Properties of Minimal Trap Spaces of Boolean Networks. CMSB 2023: 157-174 - [c71]Gilles Audemard
On Contrastive Explanations for Tree-Based Classifiers. ECAI 2023: 117-124 - [c70]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 - [c69]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 - [c68]Gilles Audemard, Steve Bellart, Jean-Marie Lagniez, Pierre Marquis
Computing Abductive Explanations for Boosted Regression Trees. IJCAI 2023: 3432-3441 - [c67]Jean-Marie Lagniez
Boosting Definability Bipartition Computation Using SAT Witnesses. JELIA 2023: 697-711 - [c66]Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly, Julien Rossit:
A New Evolutive Generator for Graphs with Communities and its Application to Abstract Argumentation. JIAF 2023: 28-38 - [c65]Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly, Julien Rossit:
A New Evolutive Generator for Graphs with Communities and its Application to Abstract Argumentation. Arg&App@KR 2023: 52-64 - [i7]Sara Riva, Jean-Marie Lagniez, Gustavo Magaña López, Loïc Paulevé:
Tackling Universal Properties of Minimal Trap Spaces of Boolean Networks. CoRR abs/2305.02442 (2023) - 2022
- [j11]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) - [c64]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 - [c63]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 - [c62]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 - [c61]Gilles Audemard, Jean-Marie Lagniez, Marie Miceli, Olivier Roussel:
Identifying Soft Cores in Propositional Formulæ. ICAART (2) 2022: 486-495 - [c60]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 - [c59]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
- [j10]Nicolas Schwind
On the computation of probabilistic coalition structures. Auton. Agents Multi Agent Syst. 35(1): 14 (2021) - [c58]Florent Capelli, Jean-Marie Lagniez, Pierre Marquis:
Certifying Top-Down Decision-DNNF Compilers. AAAI 2021: 6244-6253 - [c57]Nicolas Schwind, Emir Demirovic, Katsumi Inoue, Jean-Marie Lagniez:
Partial Robustness in Team Formation: Bridging the Gap between Robustness and Resilience. AAMAS 2021: 1154-1162 - [c56]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) - [i2]Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly
Design and Results of ICCMA 2021. CoRR abs/2109.08884 (2021) - 2020
- [j9]Jean-Marie Lagniez, Emmanuel Lonca, Pierre Marquis
Definability for model counting. Artif. Intell. 281: 103229 (2020) - [c55]Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly, Julien Rossit:
Introducing the Fourth International Competition on Computational Models of Argumentation. SAFA@COMMA 2020: 80-85 - [c54]Zied Bouraoui, Jean-Marie Lagniez, Pierre Marquis, Valentin Montmirail:
Consolidating Modal Knowledge Bases. ECAI 2020: 648-655 - [c53]Nicolas Schwind, Sébastien Konieczny, Jean-Marie Lagniez, Pierre Marquis
On Computational Aspects of Iterated Belief Change. IJCAI 2020: 1770-1776 - [c52]Gael Glorian
NACRE - A Nogood And Clause Reasoning Engine. LPAR 2020: 249-259
2010 – 2019
- 2019
- [b1]Jean-Marie Lagniez:
Promenade au-delà de NP. (Beyond NP). Artois University, Arras, France, 2019 - [c51]Jean-Marie Lagniez, Pierre Marquis:
A Recursive Algorithm for Projected Model Counting. AAAI 2019: 1536-1543 - [c50]Gael Glorian
An Incremental SAT-Based Approach to the Graph Colouring Problem. CP 2019: 213-231 - [c49]Nicolas Schwind, Katsumi Inoue
What Has Been Said? Identifying the Change Formula in a Belief Revision Scenario. IJCAI 2019: 1865-1871 - 2018
- [j8]Éric Grégoire, Jean-Marie Lagniez, Du Zhang:
Consensus-finding that preserves mutually conflicting hypothetical information from a same agent. AI Commun. 31(3): 303-317 (2018) - [j7]Éric Grégoire, Jean-Marie Lagniez, Du Zhang:
Preface. Int. J. Artif. Intell. Tools 27(1): 1802001:1-1802001:2 (2018) - [c48]Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem. IJCAR 2018: 1-18 - [c47]Gael Glorian
An Incremental SAT-Based Approach to Reason Efficiently on Qualitative Constraint Networks. CP 2018: 160-178 - [c46]Éric Grégoire, Yacine Izza, Jean-Marie Lagniez:
Boosting MCSes Enumeration. IJCAI 2018: 1309-1315 - [c45]Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski:
DMC: A Distributed Model Counter. IJCAI 2018: 1331-1338 - [c44]Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
A SAT-Based Approach For PSPACE Modal Logics. KR 2018: 651-652 - [c43]Nicolas Schwind, Tenda Okimoto, Katsumi Inoue, Katsutoshi Hirayama, Jean-Marie Lagniez, Pierre Marquis:
Probabilistic Coalition Structure Generation. KR 2018: 663-664 - 2017
- [j6]Jean-Marie Lagniez, Pierre Marquis:
On Preprocessing Techniques and Their Impact on Propositional Model Counting. J. Autom. Reason. 58(4): 413-481 (2017) - [c42]Sébastien Konieczny, Jean-Marie Lagniez, Pierre Marquis:
SAT Encodings for Distance-Based Belief Merging Operators. AAAI 2017: 1163-1169 - [c41]Thomas Caridroit, Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail:
A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem. AAAI 2017: 3864-3870 - [c40]Gael Glorian
Combining Nogoods in Restart-Based Search. CP 2017: 129-138 - [c39]Jean-Marie Lagniez, Pierre Marquis, Anastasia Paparrizou:
Defining and Evaluating Heuristics for the Compilation of Constraint Networks. CP 2017: 172-188 - [c38]Éric Grégoire, Yacine Izza, Jean-Marie Lagniez:
On Computing One Max_Subset Inclusion Consensus. ICTAI 2017: 838-845 - [c37]Jean-Marie Lagniez, Pierre Marquis:
An Improved Decision-DNNF Compiler. IJCAI 2017: 667-673 - [c36]Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail
A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem. IJCAI 2017: 674-680 - [c35]Sébastien Konieczny
Boosting Distance-Based Revision Using SAT Encodings. LORI 2017: 480-496 - [c34]Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary:
A Distributed Version of Syrup. SAT 2017: 215-232 - 2016
- [j5]Éric Grégoire, Jean-Marie Lagniez:
A Computational Method for Enforcing Knowledge that Cannot be Subsumed. Int. J. Artif. Intell. Tools 25(4): 1650024:1-1650024:19 (2016) - [j4]Éric Grégoire, Jean-Marie Lagniez:
RCL: An A. I. Tool for Computing Maximal Consensuses. Int. J. Artif. Intell. Tools 25(4): 1650026:1-1650026:10 (2016) - [c33]Éric Grégoire, Jean-Marie Lagniez, Du Zhang:
Logical consensuses for case-based reasoning and for mathematical engineering of AI. ICCI*CC 2016: 29-33 - [c32]Éric Grégoire, Yacine Izza, Jean-Marie Lagniez:
On the Extraction of One Maximal Information Subset That Does Not Conflict with Multiple Contexts. AAAI 2016: 3404-3410 - [c31]Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail:
On Checking Kripke Models for Modal Logic K. PAAR@IJCAR 2016: 69-81 - [c30]Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary:
An Adaptive Parallel SAT Solver. CP 2016: 30-48 - [c29]Éric Grégoire, Jean-Marie Lagniez, Du Zhang:
On Computing Non-hypocritical Consensuses in Standard Logic. DEXA Workshops 2016: 97-101 - [c28]Anicet Bart, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis:
An Improved CNF Encoding Scheme for Probabilistic Inference. ECAI 2016: 613-621 - [c27]Éric Grégoire, Jean-Marie Lagniez:
A Computational Approach to Consensus-Finding. ECAI 2016: 795-801 - [c26]Jean-Marie Lagniez, Emmanuel Lonca, Pierre Marquis:
Improving Model Counting by Leveraging Definability. IJCAI 2016: 751-757 - [c25]Éric Grégoire, Sébastien Konieczny, Jean-Marie Lagniez:
On Consensus Extraction. IJCAI 2016: 1095-1101 - 2015
- [j3]Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure:
On getting rid of the preprocessing minimization step in MUC-finding algorithms. Constraints An Int. J. 20(4): 414-432 (2015) - [c24]Philippe Besnard, Éric Grégoire, Jean-Marie Lagniez:
On Computing Maximal Subsets of Clauses that Must Be Satisfiable with Possibly Mutually-Contradictory Assumptive Contexts. AAAI 2015: 3710-3716 - [c23]Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly
CoQuiAAS: A Constraint-Based Quick Abstract Argumentation Solver. ICTAI 2015: 928-935 - [c22]Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Samuel Thomas:
Compiling Constraint Networks into Multivalued Decomposable Decision Graphs. IJCAI 2015: 332-338 - [c21]Éric Grégoire, Jean-Marie Lagniez:
On Anti-subsumptive Knowledge Enforcement. LPAR 2015: 48-62 - 2014
- [j2]Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure:
Boosting MUC extraction in unsatisfiable constraint networks. Appl. Intell. 41(4): 1012-1023 (2014) - [j1]Gilles Audemard, Armin Biere
Améliorer SAT dans le cadre incrémental. Rev. d'Intelligence Artif. 28(5): 593-614 (2014) - [c20]Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure:
An Experimentally Efficient Method for (MSS, CoMSS) Partitioning. AAAI 2014: 2666-2673 - [c19]Jean-Marie Lagniez, Pierre Marquis:
Preprocessing for Propositional Model Counting. AAAI 2014: 2688-2694 - [c18]Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure:
A General Artificial Intelligence Approach for Skeptical Reasoning. AGI 2014: 33-42 - [c17]Anicet Bart, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis:
Symmetry-Driven Decision Diagrams for Knowledge Compilation. ECAI 2014: 51-56 - [c16]Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure:
Enforcing Solutions in Constraint Networks. ECAI 2014: 1017-1018 - [c15]Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure:
Multiple Contraction through Partial-Max-SAT. ICTAI 2014: 321-327 - 2013
- [c14]Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure:
Questioning the Importance of WCORE-Like Minimization Steps in MUC-Finding Algorithms. ICTAI 2013: 923-930 - [c13]Gilles Audemard, Jean-Marie Lagniez, Laurent Simon:
Just-In-Time Compilation of Knowledge Bases. IJCAI 2013: 447-453 - [c12]Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure:
Preserving Partial Solutions While Relaxing Constraint Networks. IJCAI 2013: 552-558 - [c11]Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis, Samuel Thomas:
Knowledge Compilation for Model Counting: Affine Decision Trees. IJCAI 2013: 947-953 - [c10]Jean-Marie Lagniez, Armin Biere
Factoring Out Assumptions to Speed Up MUS Extraction. SAT 2013: 276-292 - [c9]Gilles Audemard, Jean-Marie Lagniez, Laurent Simon:
Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction. SAT 2013: 309-317 - [i1]Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure:
Improving MUC extraction thanks to local search. CoRR abs/1307.3585 (2013) - 2012
- [c8]Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure:
Relax! ICTAI 2012: 146-153 - [c7]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
- [c6]Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure:
A CSP Solver Focusing on fac Variables. CP 2011: 493-507 - [c5]Long Guo, Jean-Marie Lagniez:
Dynamic Polarity Adjustment in a Parallel SAT Solver. ICTAI 2011: 67-73 - [c4]Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais:
On Freezing and Reactivating Learnt Clauses. SAT 2011: 188-200 - 2010
- [c3]Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais:
Boosting Local Search Thanks to cdcl. LPAR (Yogyakarta) 2010: 474-488
2000 – 2009
- 2009
- [c2]Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais:
Learning in Local Search. ICTAI 2009: 417-424 - [c1]Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais:
Integrating Conflict Driven Clause Learning to Local Search. LSCS 2009: 55-68
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-09-18 23:42 CEST 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: