Follow
Jean-Marie Lagniez
Jean-Marie Lagniez
Professor of Computer Science, CRIL - Artois University
Verified email at cril.fr - Homepage
Title
Cited by
Cited by
Year
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
1732013
An Improved Decision-DNNF Compiler.
JM Lagniez, P Marquis
IJCAI 17, 667-673, 2017
1352017
On freezing and reactivating learnt clauses
G Audemard, JM Lagniez, B Mazure, L Sais
Theory and Applications of Satisfiability Testing-SAT 2011: 14th …, 2011
912011
Coquiaas: A constraint-based quick abstract argumentation solver
JM Lagniez, E Lonca, JG Mailly
2015 IEEE 27th International Conference on Tools with Artificial …, 2015
622015
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
552012
Factoring out assumptions to speed up MUS extraction
JM Lagniez, A Biere
International Conference on Theory and Applications of Satisfiability …, 2013
522013
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
512014
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
432021
Knowledge Compilation for Model Counting: Affine Decision Trees.
F Koriche, JM Lagniez, P Marquis, S Thomas
IJCAI, 947-953, 2013
422013
Boosting Local Search Thanks to cdcl
G Audemard, JM Lagniez, B Mazure, L Saïs
Logic for Programming, Artificial Intelligence, and Reasoning: 17th …, 2010
372010
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
332017
Improving Model Counting by Leveraging Definability.
JM Lagniez, E Lonca, P Marquis
IJCAI, 751-757, 2016
322016
Preprocessing for propositional model counting
JM Lagniez, P Marquis
Proceedings of the AAAI Conference on Artificial Intelligence 28 (1), 2014
322014
A recursive algorithm for projected model counting
JM Lagniez, P Marquis
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1536-1543, 2019
312019
Boosting MCSes Enumeration.
É Grégoire, Y Izza, JM Lagniez
IJCAI, 1309-1315, 2018
302018
An adaptive parallel SAT solver
G Audemard, JM Lagniez, N Szczepanski, S Tabary
International Conference on Principles and Practice of Constraint …, 2016
282016
On preprocessing techniques and their impact on propositional model counting
JM Lagniez, P Marquis
Journal of Automated Reasoning 58 (4), 413-481, 2017
212017
A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem.
JM Lagniez, D Le Berre, T De Lima, V Montmirail
IJCAI, 674-680, 2017
202017
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
192022
PeneLoPe, a parallel clause-freezer solver
G Audemard, B Hoessen, S Jabbour, JM Lagniez, C Piette
Proceedings of SAT Challenge 2012; Solver and, 43, 2012
192012
The system can't perform the operation now. Try again later.
Articles 1–20