428 search results - page 68 / 86 » FPGA-Based SAT Solver |
GLVLSI
2003
IEEE
14 years 29 days ago
2003
IEEE
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
WEBDB
2010
Springer
14 years 22 days ago
2010
Springer
We present a robust method for gathering relational facts from the Web, based on matching generalized patterns which are automatically learned from seed facts for relations of int...
AAAI
2008
13 years 10 months ago
2008
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
AAAI
2004
13 years 9 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...