422 search results - page 4 / 85 » Multithreaded SAT Solving |
64
Voted
DATE
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper, we propose a novel approximation algorithm (RelaxSAT) for MIN-ONE SAT. RelaxSAT generates a set of constraints from the objective function to guide the search. The ...
94
Voted
SAT
2007
Springer
15 years 8 months ago
2007
Springer
We first define a mapping from CSP to many-valued SAT which allows to solve CSP instances with many-valued SAT solvers. Second, we define a new many-valued resolution rule and p...
103
click to vote
SAT
2004
Springer
15 years 7 months ago
2004
Springer
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...
ISMVL
2006
IEEE
15 years 8 months ago
2006
IEEE
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
101
Voted
GRID
2010
Springer
14 years 11 months ago
2010
Springer
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...