On Checking Kripke Models for Modal Logic K. - Jean-Marie Lagniez; Daniel Le Berre; Tiago de Lima; Valentin Montmirail (PAAR@IJCAR, 2016)

A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem. - Thomas Caridroit; Jean-Marie Lagniez; Daniel Le Berre; Tiago de Lima; Valentin Montmirail (AAAI, 2017)

A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem. - Jean-Marie Lagniez; Daniel Le Berre; Tiago de Lima; Valentin Montmirail (IJCAI, 2017)

An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem. - Jean-Marie Lagniez; Daniel Le Berre; Tiago de Lima; Valentin Montmirail (IJCAR, 2018)

An Incremental SAT-Based Approach to Reason Efficiently on Qualitative Constraint Networks. - Gael Glorian; Jean-Marie Lagniez; Valentin Montmirail; Michael Sioutis (CP, 2018)

A SAT-Based Approach For PSPACE Modal Logics. - Jean-Marie Lagniez; Daniel Le Berre; Tiago de Lima; Valentin Montmirail (KR, 2018)

Practical resolution of satisfiability testing for modal logics. (Résolution pratique du test de cohérence en logiques modales). - Valentin Montmirail (2018)

Solving Equations on Discrete Dynamical Systems. - Alberto Dennunzio; Enrico Formenti; Luciano Margara; Valentin Montmirail; Sara Riva (CIBB, 2019)

An Incremental SAT-Based Approach to the Graph Colouring Problem. - Gael Glorian; Jean-Marie Lagniez; Valentin Montmirail; Nicolas Szczepanski (CP, 2019)

Decrypting the Hill Cipher via a Restricted Search over the Text-Space. - Florent Dewez; Valentin Montmirail (HistoCrypt, 2019)

Consolidating Modal Knowledge Bases. - Zied Bouraoui; Jean-Marie Lagniez; Pierre Marquis; Valentin Montmirail (ECAI, 2020)