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
1442013
On freezing and reactivating learnt clauses
G Audemard, JM Lagniez, B Mazure, L Sais
International Conference on Theory and Applications of Satisfiability …, 2011
832011
An Improved Decision-DNNF Compiler.
JM Lagniez, P Marquis
IJCAI 17, 667-673, 2017
642017
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
532012
Coquiaas: A constraint-based quick abstract argumentation solver
JM Lagniez, E Lonca, JG Mailly
2015 IEEE 27th International Conference on Tools with Artificial …, 2015
522015
Factoring out assumptions to speed up MUS extraction
JM Lagniez, A Biere
International Conference on Theory and Applications of Satisfiability …, 2013
442013
An experimentally efficient method for (MSS, CoMSS) partitioning
É Grégoire, JM Lagniez, B Mazure
Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014
432014
Boosting Local Search Thanks to cdcl
G Audemard, JM Lagniez, B Mazure, L Saïs
International Conference on Logic for Programming Artificial Intelligence …, 2010
302010
Preprocessing for propositional model counting
JM Lagniez, P Marquis
Proceedings of the AAAI Conference on Artificial Intelligence 28 (1), 2014
252014
Knowledge compilation for model counting: Affine decision trees
F Koriche, JM Lagniez, P Marquis, S Thomas
Twenty-Third International Joint Conference on Artificial Intelligence, 2013
252013
An adaptive parallel SAT solver
G Audemard, JM Lagniez, N Szczepanski, S Tabary
International Conference on Principles and Practice of Constraint …, 2016
242016
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
192017
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
Boosting MCSes Enumeration.
É Grégoire, Y Izza, JM Lagniez
IJCAI, 1309-1315, 2018
172018
Learning in local search
G Audemard, JM Lagniez, B Mazure, L Sais
2009 21st IEEE International Conference on Tools with Artificial …, 2009
172009
A recursive algorithm for projected model counting
JM Lagniez, P Marquis
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1536-1543, 2019
162019
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
162017
On preprocessing techniques and their impact on propositional model counting
JM Lagniez, P Marquis
Journal of Automated Reasoning 58 (4), 413-481, 2017
142017
Improving Model Counting by Leveraging Definability.
JM Lagniez, E Lonca, P Marquis
IJCAI, 751-757, 2016
142016
On computing maximal subsets of clauses that must be satisfiable with possibly mutually-contradictory assumptive contexts
P Besnard, É Grégoire, JMJM Lagniez
Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015
142015
The system can't perform the operation now. Try again later.
Articles 1–20