An efficient sequential SAT solver with improved search strategies

F. Lu*, M. K. Iyer, G. Parthasarathy, L. C. Wang, K. T. Cheng, K. C. Chen

*Corresponding author for this work

Research output: Chapter in Book/Conference Proceeding/ReportConference Paper published in a bookpeer-review

36 Citations (Scopus)

Abstract

A sequential SAT solver Satori [I] was recently proposed as an alternative to combinational SAT in verification applications. This paper describes the design of Seq-SAT - an efficient sequential SAT solver with improved search strategies over Satori. The major improvements include (1) a new and better heuristic for minimizing the set of assignments to state variables, (2) a new priority-based search strategy and a flexible sequential search framework which integrates different search strategies, and (3) a decision variable selection heuristic more suitable for solving the sequential problems. We present experimental results to demonstrate that our sequential SAT solver can achieve orders-of-magnitude speedup over Satori, We plan to release the source code of Seq-SAT along with this paper.

Original languageEnglish
Title of host publicationProceedings - Design, Automation and Test in Europe, DATE '05
Pages1102-1107
Number of pages6
DOIs
Publication statusPublished - 2005
Externally publishedYes
EventDesign, Automation and Test in Europe, DATE '05 - Munich, Germany
Duration: 7 Mar 200511 Mar 2005

Publication series

NameProceedings -Design, Automation and Test in Europe, DATE '05
VolumeII
ISSN (Print)1530-1591

Conference

ConferenceDesign, Automation and Test in Europe, DATE '05
Country/TerritoryGermany
CityMunich
Period7/03/0511/03/05

Fingerprint

Dive into the research topics of 'An efficient sequential SAT solver with improved search strategies'. Together they form a unique fingerprint.

Cite this