Computer Software
An Incremental SAT Solving Library and its Applications
Tatsuya SAKOTakehide SOHMutsunori BANBARANaoyuki TAMURAHidetomo NABESHIMAKatsumi INOUE
Author information
JOURNALS FREE ACCESS

Volume 33 (2016) Issue 4 Pages 4_16-4_29

Details
Download PDF (801K) Contact us
Abstract

Remarkable improvements on SAT solvers over the last decade have led the success of SAT-based solvers. However, existing SAT-based solvers cannot efficiently solve optimization and enumeration problems since those solvers invoke SAT solvers multiple times from scratch and do not reuse search information such as learnt clauses. Recently, incremental SAT method has been proposed to efficiently solve these problems. In addition, such incremental SAT API is proposed in SAT Race 2015. In this paper, we propose iSAT, an extended incremental SAT API, and describe its application. This proposed API allows users to implement SAT-based systems concisely and within Java. We show the effectiveness of using iSAT through experimental results on shop-scheduling, N-queens, and Hamiltonian cycle problems.

Information related to the author
© 2016 Japan Society for Software Science and Technology
Previous article Next article

Recently visited articles
feedback
Top