SOLVING THE INCREMENTAL SATISFIABILITY PROBLEM

被引：52

作者：

HOOKER, JN ^{[1
]}

机构：

[1] CARNEGIE MELLON UNIV, GRAD SCH IND ADM, PITTSBURGH, PA 15213 USA

来源：

JOURNAL OF LOGIC PROGRAMMING | 1993年 / 15卷 / 1-2期

关键词：

D O I：

10.1016/0743-1066(93)90018-C

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：177 / 186

页数：10