50 search results - page 4 / 10 » On Solving MaxSAT Through SAT |
CP
2007
Springer
15 years 3 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...
AAAI
2008
15 years 2 months ago
2008
AAAI
2006
15 years 1 months ago
2006
DATE
2008
IEEE
15 years 1 months ago
2008
IEEE
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
101
click to vote
PPDP
2010
Springer
14 years 10 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...