428 search results - page 11 / 86 » FPGA-Based SAT Solver |
CP
2010
Springer
13 years 6 months ago
2010
Springer
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
CP
2007
Springer
14 years 1 months ago
2007
Springer
As SAT becomes more popular due to its ability to handle large real-world problems, progress in efficiency appears to have slowed down over the past few years. On the other hand, w...
ISCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
— All-solution Boolean satisfiability (SAT) solvers are engines employed to find all the possible solutions to a SAT problem. Their applications are found throughout the EDA in...
CP
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. Lazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy cla...
ICGI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...