论文信息 - Exact MinSAT Solving

Exact MinSAT Solving

We present an original approach to exact MinSAT solving based on solving MinSAT using MaxSAT encodings and MaxSAT solvers, and provide empirical evidence that our generic approach is competitive.

Zhu Zhu | Felip Manyà | Chu Min Li | Zhe Quan

[1] Felip Manyà,et al. MaxSAT, Hard and Soft Constraints , 2021, Handbook of Satisfiability.

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

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

[4] Oliver Kullmann,et al. Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings , 2009, SAT.

[5] Toby Walsh,et al. Handbook of satisfiability , 2009 .

[6] Patric R. J. Östergård,et al. A fast algorithm for the maximum clique problem , 2002, Discret. Appl. Math..

[7] Madhav V. Marathe,et al. On Approximation Algorithms for the Minimum Satisfiability Problem , 1996, Inf. Process. Lett..

[8] Felip Manyà,et al. New Inference Rules for Max-SAT , 2007, J. Artif. Intell. Res..

[9] Petr Kolman,et al. Minimum Common String Partition Problem: Hardness and Approximations , 2004, Electron. J. Comb..

[10] Janez Konc,et al. An improved branch and bound algorithm for the maximum clique problem , 2007 .