101 search results - page 12 / 21 » A Case for Simple SAT Solvers |
SIGSOFT
2000
ACM
13 years 11 months ago
2000
ACM
An automatic analysis method for first-order logic with sets and relations is described. A first-order formula is translated to a quantifier-free boolean formula, which has a mode...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We consider the problem of how to improve the efficiency of Multiple Kernel Learning (MKL). In literature, MKL is often solved by an alternating approach: (1) the minimization of ...
DAC
2007
ACM
14 years 8 months ago
2007
ACM
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
AB
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A network of reactions is a commonly used paradigm for representing knowledge about a biological process. How does one understand such generic networks and answer queries...