Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
From MaRDI portal
Publication:3502710
DOI10.1007/978-3-540-79719-7_21zbMath1138.68548OpenAlexW1559357575MaRDI QIDQ3502710
Vasco M. Manquinho, João P. Marques-Silva
Publication date: 27 May 2008
Published in: Theory and Applications of Satisfiability Testing – SAT 2008 (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/265228/1/jpms-sat08a.pdf
Related Items
Boosting branch-and-bound MaxSAT solvers with clause learning ⋮ Boolean lexicographic optimization: algorithms \& applications ⋮ A taxonomy of exact methods for partial Max-SAT ⋮ Solving (Weighted) Partial MaxSAT through Satisfiability Testing ⋮ Generalizing Core-Guided Max-SAT ⋮ Algorithms for Weighted Boolean Optimization ⋮ Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search ⋮ RC2: an Efficient MaxSAT Solver ⋮ Iterative and core-guided maxsat solving: a survey and assessment
Uses Software
Cites Work
This page was built for publication: Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms