Maria Luisa Bonet
Maria Luisa Bonet
LSI, UPC
Verified email at lsi.upc.edu - Homepage
Title
Cited by
Cited by
Year
Lower bounds for cutting planes proofs with small coefficients
M Bonet, T Pitassi, R Raz
Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995
1701995
Solving (weighted) partial MaxSAT through satisfiability testing
C Ansótegui, ML Bonet, J Levy
International conference on theory and applications of satisfiability …, 2009
1472009
SAT-based MaxSAT algorithms
C Ansótegui, ML Bonet, J Levy
Artificial Intelligence 196, 77-105, 2013
1242013
On interpolation and automatization for Frege systems
ML Bonet, T Pitassi, R Raz
SIAM Journal on Computing 29 (6), 1939-1967, 2000
1172000
On the relative complexity of resolution refinements and cutting planes proof systems
ML Bonet, JL Esteban, N Galesi, J Johannsen
SIAM Journal on Computing 30 (5), 1462-1484, 2000
1002000
Resolution for max-sat
ML Bonet, J Levy, F Manyà
Artificial Intelligence 171 (8-9), 606-618, 2007
922007
Optimality of size-width tradeoffs for resolution
ML Bonet, N Galesi
Computational Complexity 10 (4), 261-276, 2001
882001
A study of proof search algorithms for resolution and polynomial calculus
ML Bonet, N Galesi
40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999
721999
A New Algorithm for Weighted Partial MaxSAT.
C Ansótegui, ML Bonet, J Levy
AAAI, 2010
652010
On the automatizability of resolution and related propositional proof systems
A Atserias, ML Bonet
Information and Computation 189 (2), 182-201, 2004
582004
Approximating subtree distances between phylogenies
ML Bonet, KS John, R Mahindru, N Amenta
Journal of Computational Biology 13 (8), 1419-1434, 2006
572006
Are there hard examples for Frege systems?
ML Bonet, SR Buss, T Pitassi
Feasible Mathematics II, 30-56, 1995
551995
Size-depth tradeoffs for Boolean formulae
ML Bonet, SR Buss
Information Processing Letters 49 (3), 151-155, 1994
541994
Measuring the Hardness of SAT Instances.
C Ansótegui, ML Bonet, J Levy, F Manya
AAAI 8, 222-228, 2008
502008
Non-automatizability of bounded-depth Frege proofs
ML Bonet, C Domingo, R Gavalda, A Maciel, T Pitassi
computational complexity 13 (1-2), 47-68, 2004
482004
Lower bounds for the weak pigeonhole principle and random formulas beyond resolution
A Atserias, ML Bonet, JL Esteban
Information and Computation 176 (2), 136-152, 2002
472002
Exponential separations between restricted resolution and cutting planes proof systems
ML Bonet, JL Esteban, N Galesi, J Johannsen
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998
471998
Better methods for solving parsimony and compatibility
M Bonet, M Steel, T Warnow, S Yooseph
Journal of Computational Biology 5 (3), 391-407, 1998
461998
On the structure of industrial SAT instances
C Ansótegui, ML Bonet, J Levy
International Conference on Principles and Practice of Constraint …, 2009
442009
Towards Industrial-Like Random SAT Instances.
C Ansótegui, ML Bonet, J Levy
IJCAI 9, 387-392, 2009
422009
The system can't perform the operation now. Try again later.
Articles 1–20