A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Solving the incremental satisfiability problem

1993
*
The Journal of Logic Programming
*

D Given 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. a Suppose that a given

doi:10.1016/0743-1066(93)90018-c
fatcat:wkqs72tgxngu5hnss44l6sqtuq