Boosting branch-and-bound MaxSAT solvers with clause learning
From MaRDI portal
Publication:5106262
DOI10.3233/AIC-210178MaRDI QIDQ5106262
Jordi Coll, Kun He, Chu-Min Li, Zhenxing Xu, Felip Manyà, Djamal Habet
Publication date: 16 September 2022
Published in: AI Communications (Search for Journal in Brave)
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chaff
- SAT-based MaxSAT algorithms
- Resolution-based lower bounds in MaxSAT
- Optimal speedup of Las Vegas algorithms
- An efficient solver for weighted Max-SAT
- Resolution for Max-SAT
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- Understanding the power of Max-SAT resolution through up-resilience
- Core-guided and core-boosted search for CP
- Relaxation-aware heuristics for exact optimization in graphical models
- Clause vivification by unit propagation in CDCL SAT solvers
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- Clause size reduction with all-UIP learning
- Improving implementation of SAT competitions 2017--2019 winners
- LMHS: A SAT-IP Hybrid MaxSAT Solver
- Open-WBO: A Modular MaxSAT Solver,
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Exploiting Cycle Structures in Max-SAT
- Algorithms for Weighted Boolean Optimization
- New Upper Bounds for Maximum Satisfiability
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver
- RC2: an Efficient MaxSAT Solver
- Exploiting the Power of mip Solvers in maxsat
- Theory and Applications of Satisfiability Testing
- On Solving the Partial MAX-SAT Problem
- A Complete Calculus for Max-SAT
