Sciweavers

428 search results - page 37 / 86
» FPGA-Based SAT Solver
Sort
View
NIPS
2004
13 years 9 months ago
Comparing Beliefs, Surveys, and Random Walks
Survey propagation is a powerful technique from statistical physics that has been applied to solve the 3-SAT problem both in principle and in practice. We give, using only probabi...
Erik Aurell, Uri Gordon, Scott Kirkpatrick
ICCAD
2002
IEEE
227views Hardware» more  ICCAD 2002»
14 years 4 months ago
Generic ILP versus specialized 0-1 ILP: an update
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
JSAT
2006
108views more  JSAT 2006»
13 years 7 months ago
Translating Pseudo-Boolean Constraints into SAT
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be h...
Niklas Eén, Niklas Sörensson
CP
2007
Springer
13 years 11 months ago
On Inconsistent Clause-Subsets for Max-SAT Solving
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
Sylvain Darras, Gilles Dequen, Laure Devendeville,...
CP
2009
Springer
14 years 8 months ago
On the Structure of Industrial SAT Instances
Abstract. During this decade, it has been observed that many realworld graphs, like the web and some social and metabolic networks, have a scale-free structure. These graphs are ch...
Carlos Ansótegui, Jordi Levy, Maria Luisa B...