61 search results - page 3 / 13 » A Clause-Based Heuristic for SAT Solvers |
IBERAMIA
2004
Springer
13 years 11 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...
DATE
2003
IEEE
13 years 11 months ago
2003
IEEE
— Boolean Satistifiability has attracted tremendous research effort in recent years, resulting in the developments of various efficient SAT solver packages. Based upon their de...
ASP
2005
Springer
13 years 11 months ago
2005
Springer
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
DAC
2004
ACM
14 years 6 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
SAT
2007
Springer
13 years 12 months ago
2007
Springer
SAT solvers are often challenged with very hard problems that remain unsolved after hours of CPU time. The research community meets the challenge in two ways: (1) by improving the ...