Sciweavers

Share
26 search results - page 1 / 6
» sat 2011
Sort
View
SAT
2015
Springer
21views Hardware» more  SAT 2015»
3 years 3 months ago
HordeSat: A Massively Parallel Portfolio SAT Solver
A simple yet successful approach to parallel satisfiability (SAT) solving is to run several different (a portfolio of) SAT solvers on the input problem at the same time until one...
Tomas Balyo, Peter Sanders, Carsten Sinz
ESA
2011
Springer
210views Algorithms» more  ESA 2011»
7 years 7 months ago
Submodular Max-SAT
Yossi Azar, Iftah Gamzu, Ran Roth
SAT
2011
Springer
263views Hardware» more  SAT 2011»
7 years 10 months ago
Failed Literal Detection for QBF
Failed literal detection (FL) in SAT is a powerful approach for preprocessing. The basic idea is to assign a variable as assumption. If boolean constraint propagation (BCP) yields ...
Florian Lonsing, Armin Biere
DISOPT
2011
210views Education» more  DISOPT 2011»
8 years 2 months ago
The parameterized complexity of k-flip local search for SAT and MAX SAT
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
Stefan Szeider
CORR
2011
Springer
185views Education» more  CORR 2011»
8 years 2 months ago
The decimation process in random k-SAT
Amin Coja-Oghlan, Angelica Y. Pachon-Pinzon
books