Solving the Incremental Satisfiability ProblemThe Journal of Logic Programming
Date of Original Version3-1-1992
Abstract or DescriptionGiven a set of clauses in propositional logic that have been found satisfiable, we wish to check whether satisfiability is preserved when the clause set is incremented with a new clause. We describe an efficient implementation of the Davis-Putnam-Loveland algorithm for checking the satisfiability of the original set. We then show how to modify the algorithm for efficient solution of the incremental problem, which is NP-complete. We also report computational results.
Citation InformationJohn N. Hooker. "Solving the Incremental Satisfiability Problem" The Journal of Logic Programming Vol. 15 Iss. 1-2 (1992) p. 177 - 186
Available at: http://works.bepress.com/jnhooker/37/