Maria Luisa Bonet

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