default search action
Maria Luisa Bonet
Person information
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j29]Ilario Bonacina
, Maria Luisa Bonet
Polynomial calculus for optimization. Artif. Intell. 337: 104208 (2024) - [j28]Ilario Bonacina, Maria Luisa Bonet, Jordi Levy:
Weighted, Circular and Semi-Algebraic Proofs. J. Artif. Intell. Res. 79: 447-482 (2024) - [c44]Ilario Bonacina, Maria Luisa Bonet, Jordi Levy:
Weighted, Circular and Semi-Algebraic Proofs (Abstract Reprint). IJCAI 2024: 8475 - [c43]Ilario Bonacina, Maria Luisa Bonet, Massimo Lauria:
MaxSAT Resolution with Inclusion Redundancy. SAT 2024: 7:1-7:15 - [i12]Ilario Bonacina, Maria Luisa Bonet, Sam Buss, Massimo Lauria:
Redundancy for MaxSAT. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c42]Carlos Ansótegui
On the Density of States of Boolean Formulas. CCIA 2023: 369-382 - [c41]Ilario Bonacina, Maria Luisa Bonet, Jordi Levy:
Polynomial Calculus for MaxSAT. SAT 2023: 5:1-5:17 - 2022
- [j27]Carlos Ansótegui
Scale-Free Random SAT Instances. Algorithms 15(6): 219 (2022) - [c40]Ilario Bonacina
On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems. LICS 2022: 25:1-25:12 - 2021
- [j26]Maria Luisa Bonet, Sam Buss, Alexey Ignatiev
Propositional proof systems based on maximum satisfiability. Artif. Intell. 300: 103552 (2021) - [i11]Ilario Bonacina, Maria Luisa Bonet:
On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j25]James Aisenberg, Maria Luisa Bonet, Sam Buss
2-D Tucker is PPA complete. J. Comput. Syst. Sci. 108: 92-103 (2020) - [c39]Maria Luisa Bonet
Equivalence Between Systems Stronger Than Resolution. SAT 2020: 166-181
2010 – 2019
- 2019
- [j24]Carlos Ansótegui
Community Structure in Industrial SAT Instances. J. Artif. Intell. Res. 66: 443-472 (2019) - [c38]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
Phase Transition in Realistic Random SAT Models. CCIA 2019: 213-222 - [c37]António Morgado
DRMaxSAT with MaxHS: First Contact. SAT 2019: 239-249 - 2018
- [j23]James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun
Short proofs of the Kneser-Lovász coloring principle. Inf. Comput. 261: 296-310 (2018) - [c36]Maria Luisa Bonet, Sam Buss, Alexey Ignatiev, João Marques-Silva, António Morgado:
MaxSAT Resolution With the Dual Rail Encoding. AAAI 2018: 6565-6572 - 2017
- [j22]Carlos Ansótegui
Structure features for SAT instances classification. J. Appl. Log. 23: 27-39 (2017) - 2016
- [j21]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): 687-710 (2016) - [i10]Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy:
Community Structure in Industrial SAT Instances. CoRR abs/1606.03329 (2016) - 2015
- [c35]Carlos Ansótegui
On the Classification of Industrial SAT Families. CCIA 2015: 163-172 - [c34]James Aisenberg, Maria Luisa Bonet
Short Proofs of the Kneser-Lovász Coloring Principle. ICALP (2) 2015: 44-55 - [i9]James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun, Gabriel Istrate:
Short Proofs of the Kneser-Lovász Coloring Principle. CoRR abs/1505.05531 (2015) - [i8]James Aisenberg, Maria Luisa Bonet, Sam Buss:
2-D Tucker is PPA complete. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j20]Maria Luisa Bonet, Sam Buss, Jan Johannsen:
Improved Separations of Regular Resolution from Clause Learning Proof Systems. J. Artif. Intell. Res. 49: 669-703 (2014) - [c33]Carlos Ansótegui
The Fractal Dimension of SAT Formulas. IJCAR 2014: 107-121 - 2013
- [j19]Carlos Ansótegui
SAT-based MaxSAT algorithms. Artif. Intell. 196: 77-105 (2013) - [j18]Carlos Ansótegui
Resolution procedures for multiple-valued optimization. Inf. Sci. 227: 43-59 (2013) - [c32]Carlos Ansótegui
Improving WPM2 for (Weighted) Partial MaxSAT. CP 2013: 117-132 - [c31]Maria Luisa Bonet, Sam Buss:
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning (Extended Abstract). IJCAI 2013: 2972-2976 - [i7]Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy:
The Fractal Dimension of SAT Formulas. CoRR abs/1308.5046 (2013) - 2012
- [j17]Maria Luisa Bonet
The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility. IEEE ACM Trans. Comput. Biol. Bioinform. 9(1): 273-285 (2012) - [c30]Carlos Ansótegui
Analysis and Generation of Pseudo-Industrial MaxSAT Instances. CCIA 2012: 173-184 - [c29]Carlos Ansótegui
Improving SAT-Based Weighted MaxSAT Solvers. CP 2012: 86-101 - [c28]Maria Luisa Bonet
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning. SAT 2012: 44-57 - [i6]Maria Luisa Bonet, Samuel R. Buss:
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning. CoRR abs/1202.2296 (2012) - [i5]Maria Luisa Bonet, Sam Buss, Jan Johannsen:
Improved Separations of Regular Resolution from Clause Learning Proof Systems. CoRR abs/1208.2469 (2012) - 2011
- [i4]Maria Luisa Bonet, Simone Linz, Katherine St. John:
The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility. CoRR abs/1101.2170 (2011) - 2010
- [j16]Maria Luisa Bonet
On the Complexity of uSPR Distance. IEEE ACM Trans. Comput. Biol. Bioinform. 7(3): 572-576 (2010) - [c27]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
A New Algorithm for Weighted Partial MaxSAT. AAAI 2010: 3-8 - [c26]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
On Solving MaxSAT Through SAT. POS@SAT 2010: 41-48
2000 – 2009
- 2009
- [c25]Carlos Ansótegui
On Solving MaxSAT Through SAT. CCIA 2009: 284-292 - [c24]Carlos Ansótegui
On the Structure of Industrial SAT Instances. CP 2009: 127-141 - [c23]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
Towards Industrial-Like Random SAT Instances. IJCAI 2009: 387-392 - [c22]Maria Luisa Bonet
Efficiently Calculating Evolutionary Tree Measures Using SAT. SAT 2009: 4-17 - [c21]Carlos Ansótegui
Solving (Weighted) Partial MaxSAT through Satisfiability Testing. SAT 2009: 427-440 - 2008
- [c20]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
Measuring the Hardness of SAT Instances. AAAI 2008: 222-228 - [c19]Carlos Ansótegui
Random SAT Instances à la Carte. CCIA 2008: 109-117 - 2007
- [j15]Maria Luisa Bonet
Resolution for Max-SAT. Artif. Intell. 171(8-9): 606-618 (2007) - [c18]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
Inference Rules for High-Order Consistency in Weighted CSP. AAAI 2007: 167-172 - [c17]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
What Is a Real-World SAT Instance? CCIA 2007: 19-28 - [c16]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
The Logic Behind Weighted CSP. IJCAI 2007: 32-37 - [c15]Carlos Ansótegui
A Complete Resolution Calculus for Signed Max-SAT. ISMVL 2007: 22 - [c14]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
Mapping CSP into Many-Valued SAT. SAT 2007: 10-15 - 2006
- [j14]Maria Luisa Bonet
Approximating Subtree Distances Between Phylogenies. J. Comput. Biol. 13(8): 1419-1434 (2006) - [c13]Maria Luisa Bonet, Jordi Levy
A Complete Calculus for Max-SAT. SAT 2006: 240-251 - 2004
- [j13]Maria Luisa Bonet
Non-Automatizability of Bounded-Depth Frege Proofs. Comput. Complex. 13(1-2): 47-68 (2004) - [j12]Albert Atserias, Maria Luisa Bonet
On the automatizability of resolution and related propositional proof systems. Inf. Comput. 189(2): 182-201 (2004) - 2003
- [j11]Maria Luisa Bonet, Nicola Galesi:
Degree complexity for a modified pigeonhole principle. Arch. Math. Log. 42(5): 403-414 (2003) - [i3]Albert Atserias, Maria Luisa Bonet, Jordi Levy:
On Chvatal Rank and Cutting Planes Proofs. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j10]Albert Atserias, Maria Luisa Bonet
Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution. Inf. Comput. 176(2): 136-152 (2002) - [c12]Albert Atserias, Maria Luisa Bonet:
On the Automatizability of Resolution and Related Propositional Proof Systems. CSL 2002: 569-583 - [i2]Albert Atserias, Maria Luisa Bonet:
On the Automatizability of Resolution and Related Propositional Proof Systems. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j9]Maria Luisa Bonet
Optimality of size-width tradeoffs for resolution. Comput. Complex. 10(4): 261-276 (2001) - [c11]Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution. ICALP 2001: 1005-1016 - 2000
- [j8]Maria Luisa Bonet
On Interpolation and Automatization for Frege Systems. SIAM J. Comput. 29(6): 1939-1967 (2000) - [j7]Maria Luisa Bonet, Juan Luis Esteban
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems. SIAM J. Comput. 30(5): 1462-1484 (2000)
1990 – 1999
- 1999
- [j6]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): 103-131 (1999) - [c10]Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi:
Non-Automatizability of Bounded-Depth Frege Proofs. CCC 1999: 15-23 - [c9]Maria Luisa Bonet, Nicola Galesi:
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus. FOCS 1999: 422-432 - 1998
- [j5]Maria Luisa Bonet, Mike A. Steel
Better Methods for Solving Parsimony and Compatibility. J. Comput. Biol. 5(3): 391-407 (1998) - [c8]Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen:
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. FOCS 1998: 638-647 - [c7]Maria Luisa Bonet, Mike A. Steel, Tandy J. Warnow, Shibu Yooseph:
Better methods for solving parsimony and compatibility. RECOMB 1998: 40-49 - [i1]Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen:
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j4]Maria Luisa Bonet, Toniann Pitassi, Ran Raz
Lower Bounds for Cutting Planes Proofs with Small Coefficients. J. Symb. Log. 62(3): 708-728 (1997) - [c6]Maria Luisa Bonet
Linear Lower Bounds and Simulations in Frege Systems with Substitutions. CSL 1997: 115-128 - [c5]Maria Luisa Bonet, Toniann Pitassi, Ran Raz
No Feasible Interpolation for TC0-Frege Proofs. FOCS 1997: 254-263 - 1996
- [c4]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: 43-56 - [c3]Maria Luisa Bonet, Cynthia A. Phillips, Tandy J. Warnow, Shibu Yooseph:
Constructing Evolutionary Trees in the Presence of Polymorphic Characters. STOC 1996: 220-229 - 1995
- [j3]Maria Luisa Bonet, Samuel R. Buss:
The Serial Transitive Closure Problem for Trees. SIAM J. Comput. 24(1): 109-122 (1995) - [c2]Maria Luisa Bonet, Toniann Pitassi, Ran Raz
Lower bounds for cutting planes proofs with small coefficients. STOC 1995: 575-584 - 1994
- [j2]Maria Luisa Bonet
Size-Depth Tradeoffs for Boolean Fomulae. Inf. Process. Lett. 49(3): 151-155 (1994) - 1993
- [j1]Maria Luisa Bonet, Samuel R. Buss:
The Deduction Rule and Linear and Near-Linear Proof Simulations. J. Symb. Log. 58(2): 688-709 (1993) - 1991
- [c1]Maria Luisa Bonet, Samuel R. Buss:
On the Deduction Rule and the Number of Proof Lines. LICS 1991: 286-297
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: