Sciweavers

24 search results - page 2 / 5
» Portfolio-based Parallel SAT solving
Sort
View
IPPS
1999
IEEE
13 years 10 months ago
Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation Heuristic
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...
Takayuki Suyama, Makoto Yokoo, Akira Nagoya
JSAT
2008
85views more  JSAT 2008»
13 years 6 months ago
Parallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
Marijn Heule, Hans van Maaren
ISAAC
2010
Springer
216views Algorithms» more  ISAAC 2010»
13 years 4 months ago
Fractal Parallelism: Solving SAT in Bounded Space and Time
Denys Duchier, Jérôme Durand-Lose, Ma...
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
14 years 1 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert
AISC
2008
Springer
13 years 8 months ago
Strategies for Solving SAT in Grids by Randomized Search
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...