( en | de | ru )

 

Disambiguation of "Montmirail, Valentin"

Author of the publication

copydeleteadd this publication to your clipboard
An Incremental SAT-Based Approach to the Graph Colouring Problem.

, , , and . CP, volume 11802 of Lecture Notes in Computer Science, page 213-231. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Valentin Nesch

Valentin Söllig

Valentin Stakle

Valentin Wagner

Valentin Döring

 

Other publications of authors with the same name

A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem., , , , and . AAAI, page 3864-3870. AAAI Press, (2017)A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem., , , and . IJCAI, page 674-680. ijcai.org, (2017)On Checking Kripke Models for Modal Logic K., , , and . PAAR@IJCAR, volume 1635 of CEUR Workshop Proceedings, page 69-81. CEUR-WS.org, (2016)An Incremental SAT-Based Approach to the Graph Colouring Problem., , , and . CP, volume 11802 of Lecture Notes in Computer Science, page 213-231. Springer, (2019)Practical resolution of satisfiability testing for modal logics. (Résolution pratique du test de cohérence en logiques modales).. Artois University, Arras, France, (2018)Consolidating Modal Knowledge Bases., , , and . ECAI, volume 325 of Frontiers in Artificial Intelligence and Applications, page 648-655. IOS Press, (2020)A SAT-Based Approach For PSPACE Modal Logics., , , and . KR, page 651-652. AAAI Press, (2018)Solving Equations on Discrete Dynamical Systems., , , , and . CIBB, volume 12313 of Lecture Notes in Computer Science, page 119-132. Springer, (2019)An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem., , , and . IJCAR, volume 10900 of Lecture Notes in Computer Science, page 1-18. Springer, (2018)An Incremental SAT-Based Approach to Reason Efficiently on Qualitative Constraint Networks., , , and . CP, volume 11008 of Lecture Notes in Computer Science, page 160-178. Springer, (2018)