Now showing items 1-3 of 3

    • Iterative and core-guided MaxSAT solving: A survey and assessment 

      Morgado, Antonio; Heras, Federico; Liffiton, Mark; Planes Cid, Jordi; Marques-Silva, Joao (Springer Verlag, 2013)
      Maximum Satisfiability (MaxSAT) is an optimization version of SAT, and many real world applications can be naturally encoded as such. Solving MaxSAT is an important problem from both a theoretical and a practical point of ...
    • On the Performance of MaxSAT and MinSAT Solvers on 2SAT-MaxOnes 

      Argelich Romà, Josep; Béjar Torres, Ramón; Fernàndez Camon, César; Mateu Piñol, Carles; Planes Cid, Jordi (Springer International Publishing Switzerland, 2016-06-01)
      We analyze and compare two solvers for Boolean optimization problems: WMaxSatz, a solver for Partial MaxSAT, and MinSatz, a solver for Partial MinSAT. Both MaxSAT and MinSAT are similar, but previous results indicate that ...
    • SAT-based MaxSAT algorithms 

      Ansótegui Gil, Carlos José; Bonet, Maria Luisa; Levy, Jordi (Elsevier, 2013)
      Many industrial optimization problems can be translated to MaxSAT. Although the general problem is NP hard, like SAT, many practical problems may be solved using modern MaxSAT solvers. In this paper we present several ...