Maria Luisa Bonet

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 23

Top Topics

Boolean Formula

Phase Transition

Top Venues

J. Artif. Intell. Res.

Electron. Colloquium Comput. Complex.

Publications

Ilario Bonacina, Maria Luisa Bonet, Sam Buss, Massimo Lauria
Redundancy for MaxSAT. Electron. Colloquium Comput. Complex. (2024)
Ilario Bonacina, Maria Luisa Bonet, Jordi Levy
Weighted, Circular and Semi-Algebraic Proofs. J. Artif. Intell. Res. 79 (2024)
Ilario Bonacina, Maria Luisa Bonet, Massimo Lauria
MaxSAT Resolution with Inclusion Redundancy. SAT (2024)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
On the Density of States of Boolean Formulas. CCIA (2023)
Ilario Bonacina, Maria Luisa Bonet, Jordi Levy
Polynomial Calculus for MaxSAT. SAT (2023)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
Scale-Free Random SAT Instances. Algorithms 15 (6) (2022)
Ilario Bonacina, Maria Luisa Bonet
On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems. LICS (2022)
Maria Luisa Bonet, Sam Buss, Alexey Ignatiev, António Morgado, João Marques-Silva
Propositional proof systems based on maximum satisfiability. Artif. Intell. 300 (2021)
Ilario Bonacina, Maria Luisa Bonet
On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems. Electron. Colloquium Comput. Complex. 28 (2021)
Maria Luisa Bonet, Jordi Levy
Equivalence Between Systems Stronger Than Resolution. SAT (2020)
James Aisenberg, Maria Luisa Bonet, Sam Buss
2-D Tucker is PPA complete. J. Comput. Syst. Sci. 108 (2020)
António Morgado, Alexey Ignatiev, Maria Luisa Bonet, João Marques-Silva, Sam Buss
DRMaxSAT with MaxHS: First Contact. SAT (2019)
Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy, Laurent Simon
Community Structure in Industrial SAT Instances. J. Artif. Intell. Res. 66 (2019)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
Phase Transition in Realistic Random SAT Models. CCIA (2019)
Maria Luisa Bonet, Sam Buss, Alexey Ignatiev, João Marques-Silva, António Morgado
MaxSAT Resolution With the Dual Rail Encoding. AAAI (2018)
James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun, Gabriel Istrate
Short proofs of the Kneser-Lovász coloring principle. Inf. Comput. 261 (2018)
Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy
Structure features for SAT instances classification. J. Appl. Log. 23 (2017)
Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy
Community Structure in Industrial SAT Instances. CoRR (2016)
James Aisenberg, Maria Luisa Bonet, Sam Buss
Quasipolynomial Size Frege Proofs of Frankl's Theorem on the Trace of Sets. J. Symb. Log. 81 (2) (2016)
James Aisenberg, Maria Luisa Bonet, Sam Buss
2-D Tucker is PPA complete. Electron. Colloquium Comput. Complex. 22 (2015)
James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun, Gabriel Istrate
Short Proofs of the Kneser-Lovász Coloring Principle. CoRR (2015)
James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun, Gabriel Istrate
Short Proofs of the Kneser-Lovász Coloring Principle. ICALP (2) (2015)
Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy
On the Classification of Industrial SAT Families. CCIA (2015)
Maria Luisa Bonet, Sam Buss, Jan Johannsen
Improved Separations of Regular Resolution from Clause Learning Proof Systems. J. Artif. Intell. Res. 49 (2014)
Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy
The Fractal Dimension of SAT Formulas. IJCAR (2014)
Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy
The Fractal Dimension of SAT Formulas. CoRR (2013)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
Resolution procedures for multiple-valued optimization. Inf. Sci. 227 (2013)
Carlos Ansótegui, Maria Luisa Bonet, Joel Gabàs, Jordi Levy
Improving WPM2 for (Weighted) Partial MaxSAT. CP (2013)
Maria Luisa Bonet, Sam Buss
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning (Extended Abstract). IJCAI (2013)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
SAT-based MaxSAT algorithms. Artif. Intell. 196 (2013)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Chu Min Li
Analysis and Generation of Pseudo-Industrial MaxSAT Instances. CCIA (2012)
Maria Luisa Bonet, Samuel R. Buss
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning CoRR (2012)
Maria Luisa Bonet, Samuel R. Buss
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning. SAT (2012)
Maria Luisa Bonet, Simone Linz, Katherine St. John
The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility. IEEE ACM Trans. Comput. Biol. Bioinform. 9 (1) (2012)
Maria Luisa Bonet, Sam Buss, Jan Johannsen
Improved Separations of Regular Resolution from Clause Learning Proof Systems CoRR (2012)
Carlos Ansótegui, Maria Luisa Bonet, Joel Gabàs, Jordi Levy
Improving SAT-Based Weighted MaxSAT Solvers. CP (2012)
Maria Luisa Bonet, Simone Linz, Katherine St. John
The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility CoRR (2011)
Maria Luisa Bonet, Katherine St. John
On the Complexity of uSPR Distance. IEEE ACM Trans. Comput. Biol. Bioinform. 7 (3) (2010)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
A New Algorithm for Weighted Partial MaxSAT. AAAI (2010)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
On Solving MaxSAT Through SAT. POS@SAT (2010)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
Towards Industrial-Like Random SAT Instances. IJCAI (2009)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
Solving (Weighted) Partial MaxSAT through Satisfiability Testing. SAT (2009)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
On the Structure of Industrial SAT Instances. CP (2009)
Maria Luisa Bonet, Katherine St. John
Efficiently Calculating Evolutionary Tree Measures Using SAT. SAT (2009)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
On Solving MaxSAT Through SAT. CCIA (2009)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
Random SAT Instances à la Carte. CCIA (2008)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
Measuring the Hardness of SAT Instances. AAAI (2008)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
A Complete Resolution Calculus for Signed Max-SAT. ISMVL (2007)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
The Logic Behind Weighted CSP. IJCAI (2007)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
Mapping CSP into Many-Valued SAT. SAT (2007)
Maria Luisa Bonet, Jordi Levy, Felip Manyà
Resolution for Max-SAT. Artif. Intell. 171 (8-9) (2007)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
Inference Rules for High-Order Consistency in Weighted CSP. AAAI (2007)
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
What Is a Real-World SAT Instance? CCIA (2007)
Maria Luisa Bonet, Katherine St. John, Ruchi Mahindru, Nina Amenta
Approximating Subtree Distances Between Phylogenies. J. Comput. Biol. 13 (8) (2006)
Maria Luisa Bonet, Jordi Levy, Felip Manyà
A Complete Calculus for Max-SAT. SAT (2006)
Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi
Non-Automatizability of Bounded-Depth Frege Proofs. Comput. Complex. 13 (1-2) (2004)
Albert Atserias, Maria Luisa Bonet
On the automatizability of resolution and related propositional proof systems. Inf. Comput. 189 (2) (2004)
Maria Luisa Bonet, Nicola Galesi
Degree complexity for a modified pigeonhole principle. Arch. Math. Log. 42 (5) (2003)
Albert Atserias, Maria Luisa Bonet, Jordi Levy
On Chvatal Rank and Cutting Planes Proofs Electron. Colloquium Comput. Complex. (041) (2003)
Albert Atserias, Maria Luisa Bonet
On the Automatizability of Resolution and Related Propositional Proof Systems Electron. Colloquium Comput. Complex. (010) (2002)
Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban
Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution. Inf. Comput. 176 (2) (2002)
Albert Atserias, Maria Luisa Bonet
On the Automatizability of Resolution and Related Propositional Proof Systems. CSL (2002)
Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution. ICALP (2001)
Maria Luisa Bonet, Nicola Galesi
Optimality of size-width tradeoffs for resolution. Comput. Complex. 10 (4) (2001)
Maria Luisa Bonet, Toniann Pitassi, Ran Raz
On Interpolation and Automatization for Frege Systems. SIAM J. Comput. 29 (6) (2000)
Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems. SIAM J. Comput. 30 (5) (2000)
Maria Luisa Bonet, Nicola Galesi
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus. FOCS (1999)
Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi
Non-Automatizability of Bounded-Depth Frege Proofs. Computational Complexity Conference (1999)
Maria Luisa Bonet, Cynthia A. Phillips, Tandy J. Warnow, Shibu Yooseph
Constructing Evolutionary Trees in the Presence of Polymorphic Characters. SIAM J. Comput. 29 (1) (1999)
Maria Luisa Bonet, Mike A. Steel, Tandy J. Warnow, Shibu Yooseph
Better Methods for Solving Parsimony and Compatibility. J. Comput. Biol. 5 (3) (1998)
Maria Luisa Bonet, Mike A. Steel, Tandy J. Warnow, Shibu Yooseph
Better methods for solving parsimony and compatibility. RECOMB (1998)
Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. FOCS (1998)
Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems Electron. Colloquium Comput. Complex. 5 (35) (1998)
Maria Luisa Bonet, Nicola Galesi
Linear Lower Bounds and Simulations in Frege Systems with Substitutions. CSL (1997)
Maria Luisa Bonet, Toniann Pitassi, Ran Raz
No Feasible Interpolation for TC0-Frege Proofs. FOCS (1997)
Maria Luisa Bonet, Toniann Pitassi, Ran Raz
Lower Bounds for Cutting Planes Proofs with Small Coefficients. J. Symb. Log. 62 (3) (1997)
Maria Luisa Bonet, Cynthia A. Phillips, Tandy J. Warnow, Shibu Yooseph
Inferring evolutionary trees from polymorphic characters, and an analysis of the Indo-European family of languages. Mathematical Hierarchies and Biology (1996)
Maria Luisa Bonet, Cynthia A. Phillips, Tandy J. Warnow, Shibu Yooseph
Constructing Evolutionary Trees in the Presence of Polymorphic Characters. STOC (1996)
Maria Luisa Bonet, Toniann Pitassi, Ran Raz
Lower bounds for cutting planes proofs with small coefficients. STOC (1995)
Maria Luisa Bonet, Samuel R. Buss
The Serial Transitive Closure Problem for Trees. SIAM J. Comput. 24 (1) (1995)
Maria Luisa Bonet, Samuel R. Buss
Size-Depth Tradeoffs for Boolean Fomulae. Inf. Process. Lett. 49 (3) (1994)
Maria Luisa Bonet, Samuel R. Buss
The Deduction Rule and Linear and Near-Linear Proof Simulations. J. Symb. Log. 58 (2) (1993)
Maria Luisa Bonet, Samuel R. Buss
On the Deduction Rule and the Number of Proof Lines LICS (1991)