Stochastic local search for incremental SAT

Article type: Research Article

Authors: Mouhoub, Malek

Affiliations: Department of Computer Science, University of Regina, 3737 Wascana Parkway, Regina SK, Canada, S4S 0A2. Tel.: +1 306 585 4700; Fax: +1 306 585 4745; E-mail: mouhoubm@cs.uregina.ca

Abstract: The boolean satisfiability problem (SAT) is stated as follows: given a boolean formula in CNF, find a truth assignment that satisfies its clauses. In this paper, we present a general framework based on stochastic local search and the structure of the CNF formula for solving incremental SAT problems. Given a satisfiable boolean formula in CNF, incremental SAT consists of checking whether the satisfiability is preserved when new clauses are added to the current clause set and if not, look for a new assignment that satisfies the old clauses and the new ones. The results of the experimentation we have conducted demonstrate the efficiency of our method to deal with large randomly generated incremental SAT problems.

Keywords: Stochastic local search, GSAT, dynamic satisfiability

DOI: 10.3233/KES-2005-9303

Journal: International Journal of Knowledge-based and Intelligent Engineering Systems, vol. 9, no. 3, pp. 191-195, 2005