422 search results - page 34 / 85 » Multithreaded SAT Solving |
SAT
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Symmetry occurs naturally in many computational problems. The use of symmetry breaking techniques for solving search problems reduces the search space and therefore is ex...
AIPS
2000
13 years 11 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
ICTAI
2007
IEEE
14 years 4 months ago
2007
IEEE
In this paper we consider the consistency problem of temporal or spatial qualitive constraint networks. A new encoding making it possible to represent and solve this problem in th...
DNA
2005
Springer
14 years 3 months ago
2005
Springer
An algorithm that could be implemented at a molecular level for solving the satisfiability of Boolean expressions is presented. This algorithm, based on properties of specific se...
FOCS
1999
IEEE
14 years 2 months ago
1999
IEEE
We show1 that non-deterministic time NTIME(n) is not contained in deterministic time n 2and polylogarithmic space, for any > 0. This implies that (infinitely often) satisfiabi...