428 search results - page 40 / 86 » FPGA-Based SAT Solver |
JSAT
2008
13 years 9 months ago
2008
The Ternary Tree Solver (tts) is a complete solver for propositional satisfiability which was designed to have good performance on the most difficult small instances. It uses a st...
DAC
2007
ACM
14 years 10 months ago
2007
ACM
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or par...
ICTAI
2008
IEEE
14 years 3 months ago
2008
IEEE
These last years, the issue of locating and explaining contradictions inside sets of propositional clauses has received a renewed attention due to the emergence of very efficient...
CP
2008
Springer
13 years 10 months ago
2008
Springer
Experimentation of new algorithms is the usual companion section of papers dealing with SAT. However, the behavior of those algorithms is so unpredictable that even strong experime...
CP
2010
Springer
13 years 7 months ago
2010
Springer
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...