264 search results - page 12 / 53 » On the possibility of faster SAT algorithms |
162
click to vote
ENTCS
2008
15 years 6 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
146
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
It is well known that there is a sharp density threshold for a random r-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal ...
172
click to vote
ICCAD
2002
IEEE
16 years 2 months ago
2002
IEEE
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
169
click to vote
AAAI
2004
15 years 7 months ago
2004
This paper examines the relative performance of additive and multiplicative clause weighting schemes for propositional satisfiability testing. Starting with one of the most recent...
164
click to vote
JSAT
2008
15 years 6 months ago
2008
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representati...