422 search results - page 31 / 85 » Multithreaded SAT Solving |
IPPS
2010
IEEE
13 years 7 months ago
2010
IEEE
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
HVC
2005
Springer
14 years 3 months ago
2005
Springer
We present several algorithms for simultaneous SAT (propositional satisfiability) based model checking of safety properties. More precisely, we focus on Bounded Model Checking and ...
FMCAD
2004
Springer
14 years 1 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...
ICTAI
2002
IEEE
14 years 2 months ago
2002
IEEE
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
SAT
2005
Springer
14 years 3 months ago
2005
Springer
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...