Ara es mostren els items 7-14 de 14

    • Linear lower bounds and simulations in Frege systems with substitutions 

      Bonet Carbonell, M. Luisa; Galesi, Nicola (1996-10)
      Report de recerca
      Accés obert
      Our work concerns Frege systems, substitution Frege systems (sF), renaming Frege systems, top/bottom-Frege systems and extended Frege systems (eF). Urquhart shows that tautologies associated to a binary strings ...
    • Quasipolynomial size frege proofs of Frankl's Theorem on the trace of sets 

      Aisenberg, James; Bonet Carbonell, M. Luisa; Buss, Sam (2016-06-01)
      Article
      Accés obert
      We extend results of Bonet, Buss and Pitassi on Bondy's Theorem and of Nozaki, Arai and Arai on Bollobas' Theorem by proving that Frankl's Theorem on the trace of sets has quasipolynomial size Frege proofs. For constant ...
    • Scale-free random SAT instances 

      Ansótegui Gil, Carlos; Bonet Carbonell, M. Luisa; Levy Díaz, Jordi (Multidisciplinary Digital Publishing Institute (MDPI), 2022-06-20)
      Article
      Accés obert
      We focus on the random generation of SAT instances that have properties similar to real-world instances. It is known that many industrial instances, even with a great number of variables, can be solved by a clever solver ...
    • Short proofs of the Kneser-Lovász coloring principle 

      Aisenberg, James; Bonet Carbonell, M. Luisa; Buss, Sam; Craciun, Adrian; Istrate, Gabriel (2018-08)
      Article
      Accés obert
      We prove that propositional translations of the Kneser–Lovász theorem have polynomial size extended Frege proofs and quasi-polynomial size Frege proofs for all fixed values of k. We present a new counting-based combinatorial ...
    • The fractal dimension of SAT formulas 

      Ansótegui Gil, Carlos; Bonet Carbonell, M. Luisa; Giráldez Crú, Jesús; Levy Díaz, Jordi (Springer, 2014)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      Modern SAT solvers have experienced a remarkable progress on solving industrial instances. Most of the techniques have been developed after an intensive experimental process. It is believed that these techniques exploit ...
    • The Width-size method for general resolution is optimal 

      Bonet Carbonell, M. Luisa; Galesi, Nicola (1999-02)
      Report de recerca
      Accés obert
      The Width-Size Method for resolution was recently introduced by Ben-Sasson and Wigderson (BSW): Short Proofs are Narrow - Resolution Made Simple STOC 99). They found a trade-off between two complexity measures for ...
    • Towards industrial-like random SAT instances 

      Ansótegui Gil, Carlos; Bonet Carbonell, M. Luisa; Levy Díaz, Jordi (AAAI Press. Association for the Advancement of Artificial Intelligence, 2009)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      We focus on the random generation of SAT instances that have computational properties that are similar to real-world instances. It is known that industrial instances, even with a great number of variables, can be solved ...
    • Weighted, circular and semi-algebraic proofs 

      Bonacina, Ilario; Bonet Carbonell, M. Luisa; Levy Díaz, Jordi (2024-02-11)
      Article
      Accés obert
      In recent years there has been an increasing interest in studying proof systems stronger than Resolution, with the aim of building more efficient SAT solvers based on them. In defining these proof systems, we try to find ...