Understanding the power of Max-SAT resolution through up-resilience
From MaRDI portal
Publication:2046032
DOI10.1016/j.artint.2020.103397zbMath1504.68203OpenAlexW3092575679MaRDI QIDQ2046032
Djamal Habet, Mohamed Sami Cherif, André Abramé
Publication date: 16 August 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2020.103397
Related Items
Uses Software
Cites Work
- Resolution-based lower bounds in MaxSAT
- Resolution for Max-SAT
- A logical approach to efficient Max-SAT solving
- Open-WBO: A Modular MaxSAT Solver,
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- New Upper Bounds for Maximum Satisfiability
- GRASP: a search algorithm for propositional satisfiability
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver
- RC2: an Efficient MaxSAT Solver
- Unnamed Item
- Unnamed Item