Resolution-based lower bounds in MaxSAT

DOI10.1007/s10601-010-9097-9zbMath1208.68204OpenAlexW2027945171MaRDI 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

zbMATH Keywords

lower boundunderestimationinferenceMaxSAT

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (9)

Lower and Upper Bounds for Random Mimimum Satisfiability Problem ⋮ On Davis-Putnam reductions for minimally unsatisfiable clause-sets ⋮ Boosting branch-and-bound MaxSAT solvers with clause learning ⋮ Breaking Cycle Structure to Improve Lower Bound for Max-SAT ⋮ 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 ⋮ ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver

Uses Software

• MiniMaxSat

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

This page was built for publication: Resolution-based lower bounds in MaxSAT