The Incremental Satisfiability Problem for a Two Conjunctive Normal Form Academic Article uri icon

abstract

  • We propose a novel method to review K ? f when K and f are both in Conjunctive Normal Forms (CF). We extend our method to solve the incremental satisfiablity problem (ISAT), and we present different cases where ISAT can be solved in polynomial time. Espec