• A new algorithm for Weighted Partial MaxSAT 

    Ansótegui, Carlos; Bonet Carbonell, M. Luisa; Levy Díaz, Jordi (2011)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    We present and implement a Weighted Partial MaxSAT solver based on successive calls to a SAT solver. We prove the correctness of our algorithm and compare our solver with other Weighted Partial MaxSAT solvers.
  • 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 ...
  • 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 ...