DocumentCode :
260903
Title :
Overview of sequential and parallel SAT solvers
Author :
Doijade, Mahesh M. ; Kulkarni, Dinesh B.
Author_Institution :
Dept. of Comput. Sci. & Eng., Walchand Coll. of Eng., Sangli, India
fYear :
2014
fDate :
27-28 Feb. 2014
Firstpage :
1
Lastpage :
4
Abstract :
This paper gives insight into techniques used by sequential as well as parallel SAT solver for solving Boolean Satisfiability Problem. It provides a detailed overview of evolution of SAT solvers thereby elaborating the successful techniques which resulted in higher performance for SAT solving and also in several cases, points out weaknesses involved in order to pave way for designing future performance efficient SAT solvers.
Keywords :
Boolean algebra; computability; parallel algorithms; Boolean satisfiability problem; parallel SAT solvers; sequential SAT solvers; Algorithm design and analysis; Computer science; Educational institutions; Inference algorithms; Multicore processing; Parallel processing; Portfolios; Parallel SAT Solving; SAT Solver; Satisfiability problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Communication and Embedded Systems (ICICES), 2014 International Conference on
Conference_Location :
Chennai
Print_ISBN :
978-1-4799-3835-3
Type :
conf
DOI :
10.1109/ICICES.2014.7033875
Filename :
7033875
Link To Document :
بازگشت