Sciweavers

428 search results - page 25 / 86
» FPGA-Based SAT Solver
Sort
View
JAIR
2007
132views more  JAIR 2007»
13 years 7 months ago
New Inference Rules for Max-SAT
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpli...
Chu Min Li, Felip Manyà, Jordi Planes
SAT
2004
Springer
97views Hardware» more  SAT 2004»
14 years 1 months ago
Incremental Compilation-to-SAT Procedures
We focus on incremental compilation-to-SAT procedures (iCTS), a promising way to push the standard CTS approaches beyond their limits. We propose the first comprehensive framework...
Marco Benedetti, Sara Bernardini
GRID
2010
Springer
13 years 5 months ago
Parallel SAT Solving on Peer-to-Peer Desktop Grids
Abstract Satciety is a distributed parallel satisfiability (SAT) solver which focuses on tackling the domainspecific problems inherent to one of the most challenging environments f...
Sven Schulz, Wolfgang Blochinger
ATS
2009
IEEE
142views Hardware» more  ATS 2009»
14 years 2 months ago
Speeding up SAT-Based ATPG Using Dynamic Clause Activation
Abstract—SAT-based ATPG turned out to be a robust alternative to classical structural ATPG algorithms such as FAN. The number of unclassified faults can be significantly reduce...
Stephan Eggersglüß, Daniel Tille, Rolf ...
CORR
2007
Springer
157views Education» more  CORR 2007»
13 years 7 months ago
Actin - Technical Report
Abstract. The Boolean satisfiability problem (SAT) can be solved efficiently with variants of the DPLL algorithm. For industrial SAT problems, DPLL with conflict analysis depend...
Raihan H. Kibria