• Community structure in industrial SAT instances 

      Ansótegui Gil, Carlos; Bonet Carbonell, M. Luisa; Giráldez Crú, Jesús; Levy Díaz, Jordi; Simon, Laurent (2019-10-10)
      Article
      Accés obert
      Modern SAT solvers have experienced a remarkable progress on solving industrial instances. It is believed that most of these successful techniques exploit the underlying structure of industrial instances. Recently, there ...
    • Improving WPM2 for (weighted) partial MaxSAT 

      Ansótegui Gil, Carlos; Bonet Carbonell, M. Luisa; Gabàs, Joel; Levy Díaz, Jordi (Springer, 2013)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      Weighted Partial MaxSAT (WPMS) is an optimization variant of the Satisfiability (SAT) problem. Several combinatorial optimization problems can be translated into WPMS. In this paper we extend the state-of-the-art WPM2 ...
    • Polynomial calculus for MaxSAT 

      Bonacina, Ilario; Bonet Carbonell, M. Luisa; Levy Díaz, Jordi (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023)
      Text en actes de congrés
      Accés obert
      MaxSAT is the problem of finding an assignment satisfying the maximum number of clauses in a CNF formula. We consider a natural generalization of this problem to generic sets of polynomials and propose a weighted version ...
    • 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 ...
    • 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 ...
    • 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 ...