3 search results - page 1 / 1 » Detecting Disjoint Inconsistent Subformulas for Computing Lo... |
AAAI
2006
14 years 7 days ago
2006
Many lower bound computation methods for branch and bound Max-SAT solvers can be explained as procedures that search for disjoint inconsistent subformulas in the Max-SAT instance ...
CP
2007
Springer
14 years 2 months ago
2007
Springer
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
SAT
2009
Springer
14 years 5 months ago
2009
Springer
We investigate the role of cycles structures (i.e., subsets of clauses of the form ¯l1 ∨ l2, ¯l1 ∨ l3, ¯l2 ∨ ¯l3) in the quality of the lower bound (LB) of modern MaxSAT ...