Seuraa
Jean-Marie Lagniez
Jean-Marie Lagniez
Professor of Computer Science, CRIL - Artois University
Vahvistettu sähköpostiosoite verkkotunnuksessa cril.fr - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Improving glucose for incremental SAT solving with assumptions: Application to MUS extraction
G Audemard, JM Lagniez, L Simon
International conference on theory and applications of satisfiability …, 2013
1902013
An Improved Decision-DNNF Compiler.
JM Lagniez, P Marquis
IJCAI 17, 667-673, 2017
1892017
On freezing and reactivating learnt clauses
G Audemard, JM Lagniez, B Mazure, L Sais
Theory and Applications of Satisfiability Testing-SAT 2011: 14th …, 2011
952011
CoQuiAAS: A constraint-based quick abstract argumentation solver
JM Lagniez, E Lonca, JG Mailly
2015 IEEE 27th International Conference on Tools with Artificial …, 2015
722015
On the computational intelligibility of boolean classifiers
G Audemard, S Bellart, L Bounia, F Koriche, JM Lagniez, P Marquis
arXiv preprint arXiv:2104.06172, 2021
612021
Revisiting clause exchange in parallel SAT solving
G Audemard, B Hoessen, S Jabbour, JM Lagniez, C Piette
International Conference on Theory and Applications of Satisfiability …, 2012
612012
Factoring out assumptions to speed up MUS extraction
JM Lagniez, A Biere
International Conference on Theory and Applications of Satisfiability …, 2013
542013
An experimentally efficient method for (MSS, CoMSS) partitioning
É Grégoire, JM Lagniez, B Mazure
Proceedings of the AAAI Conference on Artificial Intelligence 28 (1), 2014
522014
Knowledge Compilation for Model Counting: Affine Decision Trees.
F Koriche, JM Lagniez, P Marquis, S Thomas
IJCAI, 947-953, 2013
492013
Preprocessing for propositional model counting
JM Lagniez, P Marquis
Proceedings of the AAAI Conference on Artificial Intelligence 28 (1), 2014
472014
Improving Model Counting by Leveraging Definability.
JM Lagniez, E Lonca, P Marquis
IJCAI, 751-757, 2016
452016
On the explanatory power of Boolean decision trees
G Audemard, S Bellart, L Bounia, F Koriche, JM Lagniez, P Marquis
Data & Knowledge Engineering 142, 102088, 2022
432022
Trading complexity for sparsity in random forest explanations
G Audemard, S Bellart, L Bounia, F Koriche, JM Lagniez, P Marquis
Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 5461-5469, 2022
412022
A recursive algorithm for projected model counting
JM Lagniez, P Marquis
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1536-1543, 2019
412019
Boosting Local Search Thanks to cdcl
G Audemard, JM Lagniez, B Mazure, L Sais
Logic for Programming, Artificial Intelligence, and Reasoning: 17th …, 2010
392010
A SAT-based approach for solving the modal logic S5-satisfiability problem
T Caridroit, JM Lagniez, D Le Berre, T de Lima, V Montmirail
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
372017
Boosting MCSes Enumeration.
É Grégoire, Y Izza, JM Lagniez
IJCAI, 1309-1315, 2018
352018
On preferred abductive explanations for decision trees and random forests
G Audemard, S Bellart, L Bounia, F Koriche, JM Lagniez, P Marquis
Thirty-First International Joint Conference on Artificial Intelligence …, 2022
342022
An adaptive parallel SAT solver
G Audemard, JM Lagniez, N Szczepanski, S Tabary
International Conference on Principles and Practice of Constraint …, 2016
312016
Definability for model counting
JM Lagniez, E Lonca, P Marquis
Artificial Intelligence 281, 103229, 2020
272020
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20