Sciweavers

422 search results - page 5 / 85
» Multithreaded SAT Solving
Sort
View
DAC
2009
ACM
16 years 27 days ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
SAT
2005
Springer
142views Hardware» more  SAT 2005»
15 years 5 months ago
Optimizations for Compiling Declarative Models into Boolean Formulas
Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver ...
Darko Marinov, Sarfraz Khurshid, Suhabe Bugrara, L...
AISC
2008
Springer
15 years 1 months ago
Strategies for Solving SAT in Grids by Randomized Search
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
IEEEHPCS
2010
14 years 10 months ago
Portfolio-based Parallel SAT solving
Abstract. In this paper, we explore the two well-known principles of diversification and intensification in portfolio-based parallel SAT solving. These dual concepts play an impo...
Lakhdar Sais
ICTAI
2008
IEEE
15 years 6 months ago
Haplotype Inference with Boolean Constraint Solving: An Overview
Boolean satisfiability (SAT) finds a wide range of practical applications, including Artificial Intelligence and, more recently, Bioinformatics. Although encoding some combinat...
Inês Lynce, Ana Graça, João Ma...