Jean-Marie Lagniez

Available identifiers

Publication	Date of Publication	Type
A new exact solver for (Weighted) Max\#SAT	2024-07-12	Paper
Boosting definability bipartition computation using SAT witnesses	2024-05-29	Paper
Tackling universal properties of minimal trap spaces of Boolean networks	2024-02-28	Paper
Consolidating modal knowledge bases	2021-07-06	Paper
Consensus-finding that preserves mutually conflicting hypothetical information from a same agent	2021-01-20	Paper
Definability for model counting	2020-03-04	Paper
An assumption-based approach for solving the minimal S5-satisfiability problem	2018-10-18	Paper
A computational approach to consensus-finding	2018-07-12	Paper
Boosting distance-based revision using SAT encodings	2017-11-22	Paper
Symmetry-driven decision diagrams for knowledge compilation	2017-07-18	Paper
On preprocessing techniques and their impact on propositional model counting	2017-07-06	Paper
On getting rid of the preprocessing minimization step in MUC-finding algorithms	2016-01-15	Paper
On anti-subsumptive knowledge enforcement	2016-01-12	Paper
Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction	2013-08-05	Paper
Factoring Out Assumptions to Speed Up MUS Extraction	2013-08-05	Paper
On freezing and reactivating learnt clauses	2011-06-17	Paper
Boosting local search thanks to \textsc{cdcl}	2010-10-12	Paper

This page was built for person: Jean-Marie Lagniez