Author of the publication

Clause-Learning for Modular Systems.

, and . LPNMR, volume 9345 of Lecture Notes in Computer Science, page 446-452. Springer, (2015)

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.

 

Other publications of authors with the same name

Problem Solving with the Enfragmo System., , and . Theory Pract. Log. Program., (2013)New Encoding for Translating Pseudo-Boolean Constraints into SAT., , and . SARA, AAAI, (2013)Resolution Complexity of Random Constraints.. CP, volume 2470 of Lecture Notes in Computer Science, page 295-309. Springer, (2002)The Resolution Complexity of Random Graph k-Colorability, , , and . Electron. Colloquium Comput. Complex., (2004)Clause-Learning for Modular Systems., and . LPNMR, volume 9345 of Lecture Notes in Computer Science, page 446-452. Springer, (2015)Enfragmo: A System for Modelling and Solving Search Problems with Logic., , , , and . LPAR, volume 7180 of Lecture Notes in Computer Science, page 15-22. Springer, (2012)Resolution and Constraint Satisfaction.. CP, volume 2833 of Lecture Notes in Computer Science, page 555-569. Springer, (2003)A New Method for Solving Hard Satisfiability Problems., , and . AAAI, page 440-446. AAAI Press / The MIT Press, (1992)Some Pitfalls for Experimenters with Random SAT., and . Artif. Intell., 81 (1-2): 111-125 (1996)The resolution complexity of random graph k-colorability., , , and . Discret. Appl. Math., 153 (1-3): 25-47 (2005)