Author of the publication

On the automatizability of resolution and related propositional proof systems.

, and . Inf. Comput., 189 (2): 182-201 (2004)

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

Random SAT Instances à la Carte., , and . CCIA, volume 184 of Frontiers in Artificial Intelligence and Applications, page 109-117. IOS Press, (2008)Analysis and Generation of Pseudo-Industrial MaxSAT Instances., , , and . CCIA, volume 248 of Frontiers in Artificial Intelligence and Applications, page 173-184. IOS Press, (2012)Inference Rules for High-Order Consistency in Weighted CSP., , , and . AAAI, page 167-172. AAAI Press, (2007)The Deduction Rule and Linear and Near-Linear Proof Simulations., and . J. Symb. Log., 58 (2): 688-709 (1993)On Chvatal Rank and Cutting Planes Proofs, , and . Electronic Colloquium on Computational Complexity (ECCC), (2003)Improved Separations of Regular Resolution from Clause Learning Proof Systems., , and . J. Artif. Intell. Res., (2014)On the automatizability of resolution and related propositional proof systems., and . Inf. Comput., 189 (2): 182-201 (2004)The Fractal Dimension of SAT Formulas., , , and . CoRR, (2013)Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution., , and . ICALP, volume 2076 of Lecture Notes in Computer Science, page 1005-1016. Springer, (2001)Short Proofs of the Kneser-Lovász Coloring Principle., , , , and . ICALP (2), volume 9135 of Lecture Notes in Computer Science, page 44-55. Springer, (2015)