428 search results - page 6 / 86 » FPGA-Based SAT Solver |
110
Voted
SAT
2005
Springer
15 years 7 months ago
2005
Springer
Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver ...
ECAI
2008
Springer
15 years 3 months ago
2008
Springer
The results of the last MaxSAT Evaluations suggest there is no universal best algorithm for solving MaxSAT, as the fastest solver often depends on the type of instance. Having an ...
111
Voted
CP
2007
Springer
15 years 8 months ago
2007
Springer
Motivated by the performance improvements made to SAT solvers in recent years, a number of different encodings of constraints into SAT have been proposed. Concrete examples are th...
114
Voted
SAT
2005
Springer
15 years 7 months ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
105
Voted
IEEEHPCS
2010
15 years 11 days ago
2010
This work presents the design and implementation of a massively parallel 3-SAT solver, specifically targeting random problem instances. Our approach is deterministic and features ...