Go to the content (press return)

Bonet Carbonell, M. Luisa

Total activity: 78

Scientific and technological production

1 to 50 of 78 results
 
  • The fractal dimension of SAT formulas

     Ansótegui Gil, Carlos; Bonet Carbonell, M. Luisa; Giráldez Crú, Jesús; Levy Diaz, Jordi
    International Joint Conference on Automated Reasoning
    p. 107-121
    DOI: 10.1007/978-3-319-08587-6_8
    Presentation's date: 2014-07-19
    Presentation of work at congresses
    Image
  • Improved separations of regular resolution from clause learning proof systems

     Bonet Carbonell, M. Luisa; Buss, Sam; Johannsen, Jan
    Journal of artificial intelligence research
    num. 49, p. 669-703
    Date of publication: 2014-04-01
    Journal article
  • Teoría y aplicaciones en satisfactibilidad y optimización de restricciones

     Bonet Carbonell, M. Luisa; Esteban Angeles, Juan Luis; Buss, Sam; Nordström, Jakob; Atserias, Albert
    Competitive project
  • Improving WPM2 for (weighted) partial MaxSAT

     Ansótegui Gil, Carlos; Bonet Carbonell, M. Luisa; Gabàs, Joel; Levy Diaz, Jordi
    International Conference on Principles and Practice of Constraint Programming
    p. 117-132
    DOI: 10.1007/978-3-642-40627-0_12
    Presentation's date: 2013-09-16
    Presentation of work at congresses
    Image
  • An improved separation of regular resolution from pool resolution and clause learning.

     Bonet Carbonell, M. Luisa; Buss, Sam
    International Joint Conference on Artificial Intelligence
    p. 2972-2976
    Presentation's date: 2013-08-09
    Presentation of work at congresses
  • Resolution procedures for multiple-valued optimization

     Ansótegui Gil, Carlos; Bonet Carbonell, M. Luisa; Manyà, Felip; Levy Diaz, Jordi
    Information sciences
    Vol. 227, p. 43-59
    DOI: 10.1016/j.ins.2012.12.004
    Date of publication: 2013-04-01
    Journal article
  • SAT-based MaxSAT algorithms

     Ansótegui Gil, Carlos; Bonet Carbonell, M. Luisa; Levy Diaz, Jordi
    Artificial intelligence
    Vol. 196, p. 77-105
    DOI: 10.1016/j.artint.2013.01.002
    Date of publication: 2013-03
    Journal article
  • The complexity of finding multiple solutions to betweenness and quartet compatibility

     Bonet Carbonell, M. Luisa; Linz, Simone; St. John, Katherine
    IEEE-ACM transactions on computational biology and bioinformatics
    Vol. 9, num. 1, p. 273-285
    DOI: 10.1109/TCBB.2011.108
    Date of publication: 2012-02
    Journal article
  • Analysis and generation of pseudo-industrial MaxSAT instances

     Ansótegui Gil, Carlos; Bonet Carbonell, M. Luisa; Li, Chu Min; Levy Diaz, Jordi
    International Conference of the Catalan Association for Artificial Intelligence
    p. 173-184
    DOI: 10.3233/978-1-61499-139-7-173
    Presentation's date: 2012
    Presentation of work at congresses
  • Improving SAT-based Weighted MaxSAT solvers

     Ansótegui Gil, Carlos; Bonet Carbonell, M. Luisa; Cabàs, Joel; Levy Diaz, Jordi
    International Conference on Principles and Practice of Constraint Programming
    p. 86-101
    DOI: 10.1007/978-3-642-33558-7_9
    Presentation of work at congresses
  • An improved separation of regular resolution from pool resolution and clause learning

     Bonet Carbonell, M. Luisa; Buss, Sam
    International Conference on Theory and Applications of Satisfiability Testing
    p. 44-57
    DOI: 10.1007/978-3-642-31612-8_5
    Presentation of work at congresses
  • TASSAT- Teoría, aplicaciones y sinergia en SAT, CSP y FDL

     Bonet Carbonell, M. Luisa; Esteban Angeles, Juan Luis; Maneva, Elitza; Atserias, Albert
    Competitive project
  • A new algorithm for Weighted Partial MaxSAT

     Ansótegui Gil, Carlos; Bonet Carbonell, M. Luisa; Levy Diaz, Jordi
    AAAI Conference on Artificial Intelligence
    p. 3-8
    Presentation of work at congresses
    Image
  • On the complexity of uSPR distance

     Bonet Carbonell, M. Luisa; St. John, Katherine
    IEEE-ACM transactions on computational biology and bioinformatics
    Vol. 7, num. 3, p. 572-576
    DOI: 10.1109/TCBB.2008.132
    Date of publication: 2010-09
    Journal article
  • On solving MaxSAT through SAT

     Ansótegui Gil, Carlos; Bonet Carbonell, M. Luisa; Levy Diaz, Jordi
    International Conference of the Catalan Association for Artificial Intelligence
    p. 284-292
    Presentation's date: 2009-10-21
    Presentation of work at congresses
  • On the structure of industrial SAT instances

     Ansótegui Gil, Carlos; Bonet Carbonell, M. Luisa; Levy Diaz, Jordi
    Principles and Practice of Constraint Programming
    p. 127-141
    DOI: 10.1007/978-3-642-04244-7_13
    Presentation's date: 2009-09
    Presentation of work at congresses
  • Towards industrial-like random SAT instances

     Bonet Carbonell, M. Luisa; Levy Diaz, Jordi; Ansótegui Gil, Carlos
    International Joint Conference on Artificial Intelligence
    p. 387-392
    Presentation's date: 2009-07
    Presentation of work at congresses
    Image
  • Solving (weighted) partial MaxSAT through satisfiability testing

     Ansótegui Gil, Carlos; Bonet Carbonell, M. Luisa; Levy Diaz, Jordi
    International Conference on Theory and Applications of Satisfiability Testing
    p. 427-440
    DOI: 10.1007/978-3-642-02777-2_39
    Presentation's date: 2009-07
    Presentation of work at congresses
  • Efficiently calculating evolutionary tree measures using SAT

     Bonet Carbonell, M. Luisa; St. John, Katherine
    International Conference on Theory and Applications of Satisfiability Testing
    p. 4-17
    DOI: 10.1007/978-3-642-02777-2_3
    Presentation's date: 2009-06-30
    Presentation of work at congresses
  • Efficiently calculating evolutionary tree measures using SAT  Open access

     Bonet Carbonell, M. Luisa; St. John, Katherine
    Lecture notes in computer science
    Vol. 5584, p. 4-17
    DOI: 10.1007/978-3-642-02777-2
    Date of publication: 2009
    Journal article
    Access to the full text
  • Lógica Multivaluada: Fundamentos y Aplicaciones a la Satisfactibilidad y la Satisfacción de Restricciones (MULOG-2)

     Esteban Angeles, Juan Luis; Bonet Carbonell, M. Luisa; Lozano Bojados, Antoni; Atserias, Albert; Dalmau Lloret, Victor
    Competitive project
  • Measuring the Hardness of SAT Instances

     Ansótegui Gil, Carlos; María, Luisa Bonet; Bonet Carbonell, M. Luisa; Levy Diaz, Jordi; Manyà, Felip
    Twenty-third AAAI Conference on Artificial Intelligence
    p. 222-228
    Presentation of work at congresses
  • Resolution for Max-SAT

     Bonet Carbonell, M. Luisa; Levy Diaz, Jordi; Manyà, Felip
    Artificial intelligence
    Vol. 171, num. 8-9, p. 606-618
    Date of publication: 2007-06
    Journal article
  • Mapping CSP into Many-Valued SAT

     Ansótegui Gil, Carlos; Maria, Luisa Bonet; Bonet Carbonell, M. Luisa; Levy Diaz, Jordi; Manyà, Felip
    Lecture notes in computer science
    Vol. 4501, p. 10-15
    Date of publication: 2007-05
    Journal article
  • The Logic Behind Weighted CSP

     Ansótegui Gil, Carlos; Maria, Luisa Bonet; Bonet Carbonell, M. Luisa; Levy Diaz, Jordi; Manyà, Felip
    20th International Joint Conference on Artificial Intelligence
    p. 32-37
    Presentation of work at congresses
  • Resolution for Max-SAT

     Ansótegui Gil, Carlos; Maria, Luisa Bonet; Bonet Carbonell, M. Luisa; Levy Diaz, Jordi; Manyà, Felip
    22nd AAAI conference on Artificial Intelligence
    p. 167-172
    Presentation of work at congresses
  • Mapping CSP into Many-Valued SAT

     Bonet Carbonell, M. Luisa
    Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference
    p. 10-15
    Presentation of work at congresses
  • A Complete Resolution Calculus for Signed Max-SAT

     Bonet Carbonell, M. Luisa
    37th International Symposium on Multiple-Valued Logic
    p. 22
    Presentation of work at congresses
  • Approximating Subtree Distances Between Phylogenies

     Maria, Luisa Bonet; Bonet Carbonell, M. Luisa; Katherine, Stjohn; Mahindru, Ruchi; Amenta, Nina
    Journal of computational biology
    Vol. 13, num. 8, p. 1419-1434
    Date of publication: 2006-10
    Journal article
  • A Complete Calculus for Max-SAT

     Maria, Luisa Bonet; Bonet Carbonell, M. Luisa; Levy Diaz, Jordi; Manyà, Felip
    Lecture notes in computer science
    Vol. 4121, p. 240-251
    Date of publication: 2006-08
    Journal article
  • Deducción Automática y Satisfactibilidad (IDEAS)

     Atserias, Albert; Bonet Carbonell, M. Luisa
    Competitive project
  • Non-Automatizability of Bounded-Depth Frege Proofs

     Bonet Carbonell, M. Luisa; Domingo, Carlos; Gavaldà Mestre, Ricard; Maciel, Alexis; Pitassi, Toniann
    Computational complexity
    Vol. 13, num. 1-2, p. 47-68
    Date of publication: 2004-12
    Journal article
  • On the automatizability of resolution and related propositional proof systems

     Atserias, Albert; Bonet Carbonell, M. Luisa
    Information and computation
    Vol. 189, p. 182-201
    Date of publication: 2004-01
    Journal article
  • Complexity mesures for resolution  Open access

     Esteban Angeles, Juan Luis
    Department of Computer Science, Universitat Politècnica de Catalunya
    Theses
  • Lower bounds for the weak pigeonhole principle and random formulas beyond resolution

     Atserias, Albert; Bonet Carbonell, M. Luisa; Esteban Angeles, Juan Luis
    Information and computation
    Vol. 176, num. 2, p. 136-152
    Date of publication: 2002-08
    Journal article
  • The complexity of resource-bounded propositional proofs  awarded activity

     Atserias, Albert
    Department of Computer Science, Universitat Politècnica de Catalunya
    Theses
  • On the automatizability of Resolution and related propositional proof systems

     Atserias, Albert; Bonet Carbonell, M. Luisa
    Annual Conference of the European Association for Computer Science Logic
    p. 569-583
    DOI: 10.1007/3-540-45793-3_38
    Presentation's date: 2002
    Presentation of work at congresses
  • Optimality of size-width tradeoffs fro resolution

     Maria, Luisa Bonet; Bonet Carbonell, M. Luisa; Galesi, Nicola
    Computational complexity
    Vol. 10, num. 4, p. 261-276
    Date of publication: 2001-12
    Journal article
  • Lower bounds for the Weak Pigeonhole Principle beyond Resolution

     Atserias, Albert; Bonet Carbonell, M. Luisa; Esteban Angeles, Juan Luis
    International Colloquium on Automata, Languages and Programming
    p. 1005-1016
    DOI: 10.1007/3-540-48224-5_81
    Presentation's date: 2001
    Presentation of work at congresses
  • On the complexity of propositional proof systems

     Galesi, Nicola
    Department of Computer Science, Universitat Politècnica de Catalunya
    Theses
  • On the Relative Complexity of Resolution Refinements and Cutting Planes proof Systems

     Bonet Carbonell, M. Luisa; Esteban Angeles, Juan Luis; Galesi, Nicola; Johannsen, J
    SIAM journal on computing
    Vol. 30, num. 5, p. 1462-1484
    Date of publication: 2000-05
    Journal article
  • On Interpolation and Automatization for Frege Proof Systems

     Bonet Carbonell, M. Luisa; Pitassi, T; Raz, R
    SIAM journal on computing
    Vol. 29, num. 6, p. 1939-1967
    Date of publication: 2000-01
    Journal article
  • Non-automatizability of bounded-depth Frege proofs

     Bonet Carbonell, M. Luisa
    14th. Annual IEEE Conference on Computational Complexity
    Presentation's date: 1999-05-04
    Presentation of work at congresses
  • The Width-size Method for General Resolution is Optimal

     Bonet Carbonell, M. Luisa; Galesi, Nicola
    Date: 1999-02
    Report
  • A Study of Proof Search Algorithms for Resolution and Polynomial Calculus

     Bonet Carbonell, M. Luisa; Galesi, Nicola
    40th Annual Symposium on Foundations of Computer Science
    p. 422-431
    Presentation of work at congresses
  • Non-automatizability of bounded-depth Frege proofs

     Bonet Carbonell, M. Luisa; Domingo, Carlos; Gavaldà Mestre, Ricard; Maciel, Alexis; Pitassi, Toniann
    14th. Annual IEEE Conference on Computational Complexity
    p. 15-23
    Presentation of work at congresses
  • Constructing Evolutionary Trees in the Presence of Polymorphic Characters

     Bonet Carbonell, M. Luisa; Phillips, Cynthia; Warnow, Tandy; Yooseph, Shibu
    SIAM journal on computing
    Vol. 29, num. 1, p. 103-131
    Date of publication: 1999-01
    Journal article