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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Knowledge-based and Intelligent Engineering Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
