( en | de | ru )

 

Disambiguation of "Simon, Laurent"

Author of the publication

copydeleteadd this publication to your clipboard
On the Non-degeneracy of Unsatisfiability Proof Graphs Produced by SAT Solvers.

, and . CP, volume 11008 of Lecture Notes in Computer Science, page 128-143. Springer, (2018)

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.

Laurent Bartholdi

Thomas Laurent

Laurent Ntahuga

Thomas Laurent

Laurent Herschke

 

Other publications of authors with the same name

SatEx: A Web-based Framework for SAT Experimentation., and . Electron. Notes Discret. Math., (2001)On the Glucose SAT Solver., and . Int. J. Artif. Intell. Tools, 27 (1): 1840001:1-1840001:25 (2018)Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms., and . CP, volume 5202 of Lecture Notes in Computer Science, page 630-634. Springer, (2008)Using Community Structure to Detect Relevant Learnt Clauses., , , and . SAT, volume 9340 of Lecture Notes in Computer Science, page 238-254. Springer, (2015)The Essentials of the SAT 2003 Competition., and . SAT, volume 2919 of Lecture Notes in Computer Science, page 452-467. Springer, (2003)The Second QBF Solvers Comparative Evaluation., , , and . SAT (Selected Papers, volume 3542 of Lecture Notes in Computer Science, page 376-392. Springer, (2004)On the Community Structure of Bounded Model Checking SAT Problems., , and . SAT, volume 10491 of Lecture Notes in Computer Science, page 65-82. Springer, (2017)ZRES: The Old Davis-Putman Procedure Meets ZBDD., and . CADE, volume 1831 of Lecture Notes in Computer Science, page 449-454. Springer, (2000)Predicting Learnt Clauses Quality in Modern SAT Solvers., and . IJCAI, page 399-404. (2009)Minimum Satisfiability and Its Applications., , , and . IJCAI, page 605-610. IJCAI/AAAI, (2011)