DeciLS-PBO: an effective local search method for pseudo-Boolean optimization

Graphical abstract

References

[1] Lei Z, Cai S, Luo C, Hoos H. Efficient local search for pseudo Boolean optimization. In: Proceedings of the 24th International Conference on Theory and Applications of Satisfiability Testing. 2021, 332−348

[2] Lei Z, Cai S, Luo C. Extended conjunctive normal form and an efficient algorithm for cardinality constraints. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence. 2020, 1141−1147

[3] Berg J, Demirović E, Stuckey P J. Core-boosted linear search for incomplete MaxSAT. In: Proceedings of the 16th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research. 2019, 39−56

[4] Elffers J, Nordstrom J. Divide and conquer: towards faster pseudo-Boolean solving. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence. 2018, 1291−1299

[5] Martins R, Manquinho V, Lynce I. Open-WBO: a modular MaxSAT solver. In: Proceedings of the 17th International Conference on Theory and Applications of Satisfiability Testing. 2014, 438−445

[6] Lei Z, Cai S. Solving (weighted) partial MaxSAT by dynamic local search for SAT. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence. 2018, 1346−1352

[7] Smirnov P, Berg J, Järvisalo M. Improvements to the implicit hitting set approach to pseudo-Boolean optimization. In: Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing. 2022, 13: 1−13: 18

RIGHTS & PERMISSIONS

Higher Education Press