422 search results - page 28 / 85 » Multithreaded SAT Solving |
ICCAD
2001
IEEE
14 years 6 months ago
2001
IEEE
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
ICSE
2010
IEEE-ACM
13 years 12 months ago
2010
IEEE-ACM
The transition from single-core to multi-core processors has made multi-threaded software an important subject over the last years in computer-aided verification. Model checkers ...
ICAI
2003
13 years 11 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
PPDP
2010
Springer
13 years 8 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
AIPS
2008
14 years 8 days ago
2008
In this paper, we report on a new solver for large instances of the Disjunctive Temporal Problem (DTP). Our solver is based primarily on the idea of employing "compact" ...