Now showing items 1-3 of 3

  • A new algorithm for Weighted Partial MaxSAT 

    Ansótegui, Carlos; Bonet Carbonell, M. Luisa; Levy Díaz, Jordi (2011)
    Conference report
    Restricted access - publisher's policy
    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)
    Conference report
    Restricted access - publisher's policy
    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 ...
  • 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)
    Conference report
    Restricted access - publisher's policy
    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 ...