论文信息 - A New Algorithm for Weighted Partial MaxSAT

A New Algorithm for Weighted Partial MaxSAT

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.

Maria Luisa Bonet | Carlos Ansótegui | Jordi Levy

[1] Zhaohui Fu. Extending the power of Boolean satisfiability solvers: Techniques and applications , 2007 .

[2] Kaile Su,et al. Within-problem Learning for Efficient Lower Bound Computation in Max-SAT Solving , 2008, AAAI.

[3] Maria Luisa Bonet,et al. Solving (Weighted) Partial MaxSAT through Satisfiability Testing , 2009, SAT.

[4] Joao Marques-Silva,et al. On Using Unsatisfiability for Solving Maximum Satisfiability , 2007, ArXiv.

[5] Josep Argelich,et al. The First and Second Max-SAT Evaluations , 2008, J. Satisf. Boolean Model. Comput..

[6] Armin Biere,et al. PicoSAT Essentials , 2008, J. Satisf. Boolean Model. Comput..

[7] Albert Oliveras,et al. MiniMaxSat: A New Weighted Max-SAT Solver , 2007, SAT.

[8] Sharad Malik,et al. On Solving the Partial MAX-SAT Problem , 2006, SAT.

[9] Vasco M. Manquinho,et al. Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms , 2008, SAT.

[10] Vasco M. Manquinho,et al. Algorithms for Weighted Boolean Optimization , 2009, SAT.

[11] Niklas Sörensson,et al. Translating Pseudo-Boolean Constraints into SAT , 2006, J. Satisf. Boolean Model. Comput..

[12] Felip Manyà,et al. Exploiting Cycle Structures in Max-SAT , 2009, SAT.