192 search results - page 1 / 39 » Using SAT-Solvers to Compute Inference-Proof Database Instan... |
ESORICS
2009
Springer
13 years 11 months ago
2009
Springer
DATE
2002
IEEE
13 years 10 months ago
2002
IEEE
We describe a SAT-solver, BerkMin, that inherits such features of GRASP, SATO, and Chaff as clause recording, fast BCP, restarts, and conflict clause “aging”. At the same time...
SC
2003
ACM
13 years 10 months ago
2003
ACM
We present GridSAT, a parallel and complete satisfiability solver designed to solve non-trivial SAT problem instances using a large number of widely distributed and heterogeneous...
CCECE
2006
IEEE
13 years 11 months ago
2006
IEEE
Several approaches have been proposed to accelerate the NP-complete Boolean Satisfiability problem (SAT) using reconfigurable computing. We present an FPGA based clause evaluator,...
FMCAD
2004
Springer
13 years 8 months ago
2004
Springer
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...