AAAI
1997
13 years 6 months ago
1997
One of the important components of a local search strategy for satisfiability testing is the variable selection heuristic, which determines the next variable to be flipped. In a...
IBERAMIA
2004
Springer
13 years 10 months ago
2004
Springer
We present a new branch and bound algorithm for Max-SAT which incorporates original lazy data structures, a new variable selection heuristics and a lower bound of better quality. W...
SAT
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...