Valentin Montmirail

According to our database, Valentin Montmirail authored at least 11 papers between 2016 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2020

Consolidating Modal Knowledge Bases.

Zied Bouraoui, Jean-Marie Lagniez, Pierre Marquis, Valentin Montmirail

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019

Decrypting the Hill Cipher via a Restricted Search over the Text-Space.

Florent Dewez, Valentin Montmirail

Proceedings of the 2nd International Conference on Historical Cryptology, 2019

An Incremental SAT-Based Approach to the Graph Colouring Problem.

Gael Glorian, Jean-Marie Lagniez, Valentin Montmirail, Nicolas Szczepanski

Proceedings of the Principles and Practice of Constraint Programming, 2019

Solving Equations on Discrete Dynamical Systems.

Alberto Dennunzio, Enrico Formenti, Luciano Margara, Valentin Montmirail, Sara Riva

Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2019

2018

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

Valentin Montmirail

PhD thesis, 2018

A SAT-Based Approach For PSPACE Modal Logics.

Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

An Incremental SAT-Based Approach to Reason Efficiently on Qualitative Constraint Networks.

Gael Glorian, Jean-Marie Lagniez, Valentin Montmirail, Michael Sioutis

Proceedings of the Principles and Practice of Constraint Programming, 2018

An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem.

Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail

Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

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

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

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

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

On Checking Kripke Models for Modal Logic K.

Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail

Proceedings of the 5th Workshop on Practical Aspects of Automated Reasoning co-located with International Joint Conference on Automated Reasoning (IJCAR 2016), 2016