Solving the incremental satisfiability problem
Journal of Logic Programming
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Morphing: combining structure and randomness
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
SATIRE: a new incremental satisfiability engine
Proceedings of the 38th annual Design Automation Conference
An Incremental Branch-And-Bound Method for the Satisfiability Problem
INFORMS Journal on Computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Backbone fragility and the local search cost peak
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
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.