Resolution-based lower bounds in MaxSAT
From MaRDI portal
Publication:606913
DOI10.1007/s10601-010-9097-9zbMath1208.68204MaRDI QIDQ606913
Jordi Planes, Nouredine Ould Mohamedou, Felip Manyà, Chu-Min Li
Publication date: 19 November 2010
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-010-9097-9
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Breaking Cycle Structure to Improve Lower Bound for Max-SAT, ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver, Boosting branch-and-bound MaxSAT solvers with clause learning, On Davis-Putnam reductions for minimally unsatisfiable clause-sets, On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes, Optimizing with minimum satisfiability, Understanding the power of Max-SAT resolution through up-resilience, Efficient Reasoning for Inconsistent Horn Formulae, Lower and Upper Bounds for Random Mimimum Satisfiability Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Resolution for Max-SAT
- A logical approach to efficient Max-SAT solving
- On Inconsistent Clause-Subsets for Max-SAT Solving
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- Exploiting Cycle Structures in Max-SAT
- A Complete Calculus for Max-SAT