193 search results - page 5 / 39 » sat 2007 |
SAT
2007
Springer
15 years 3 months ago
2007
Springer
We present an algorithm for finding a smallest Resolution refutation of any 2CNF in polynomial time.
DDECS
2007
IEEE
15 years 3 months ago
2007
IEEE
— Recently, there is a renewed interest in Automatic Test Pattern Generation (ATPG) based on Boolean Satisfiability (SAT). This results from the availability of very powerful SA...
AE
2007
Springer
15 years 3 months ago
2007
Springer
We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain “disposable” heuristics which are evolved and used for a specific su...
ISMVL
2007
IEEE
15 years 3 months ago
2007
IEEE
We define a resolution-style rule for solving the Max-SAT problem of Signed CNF formulas (Signed Max-SAT) and prove that our rule provides a complete calculus for that problem. F...
79
Voted
AIMSA
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...