Prepositional satisfiability (SAT) problem is fundamental to the theory of NP-completeness. Indeed, using the concept of "polynomial-time reducibility" all NP-complete problems can be polynomially reduced to SAT. Thus, any new technique for satisfiability problems will lead to general approaches for thousands of hard combinatorial problems. In this paper, we introduce the incremental prepositional satisfiability problem that consists of maintaining the satisfiability of a prepositional formula anytime a conjunction of new clauses is added. More precisely, the goal here is to check whether a solution to a SAT problem continues to be a solution anytime a new set of clauses is added and if not, whether the solution can be modified efficiently to satisfy the old formula and the new clauses. We will study the applicability of systematic and approximation methods for solving incremental SAT problems. The systematic method is based on the branch and bound technique while the approximation methods rely on stochastic local search and genetic algorithms.
CITATION STYLE
Mouhoub, M., & Sadaoui, S. (2004). Systematic versus non systematic methods for solving incremental satisfiability. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3029, pp. 543–551). Springer Verlag. https://doi.org/10.1007/978-3-540-24677-0_56
Mendeley helps you to discover research relevant for your work.