Abstract
Propositional 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 propositional satisfiability problem that consists of maintaining the satisfiability of a propositional 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hoos, H.H., O’Neil, K.: Stochastic Local Search Methods for Dynamic SAT - an Initial Investigation. In: AAAI 2000 Workshop on Leveraging Probability and Uncertainty in Computation, pp. 22–26 (2000)
Gutierrez, J., Mali, A.D.: Local Search for Incremental Satisfiability. In: International Conference on Artificial Intelligence, pp. 986–991 (2002)
Hooker, J.N.: Solving the Incremental Satisfiability Problem. Journal of Logic Programming 15, 177–186 (1993)
Bennaceur, H., Gouachi, I., Plateau, G.: An incremental Branch-and-Bound Method for Satisfiability Problem. INFORMS Journal on Computing 10, 301–308 (1998)
Whittemore, J., Kim, J., Sakallah, K.A.: SATIRE: A New Incremental Satisfiability Engine. In: DAC 2001, pp. 542–545 (2001)
Cook, S.A.: The complexity of theorem proving procedures. In: 3rd Annual ACM Symposium on the Theory of Computing, pp. 151–158 (1971)
Davis, M., Putnam, H.: Journal of The Association for Computing Machinery 7, 201–215 (1960)
Loveland, D.: Automated Theorem Proving: A Logical Basis. North-Holland, Amsterdam (1978)
Jeroslow, R.G., Blair, C.E., Lowe, J.K.: Some results and experiments in programming techniques for propositional logic. Computers and Operations Research 13(5), 633–645 (1986)
Wallace, R.J., Freuder, E.C.: Comparing constraint satisfaction and davis-putnam algorithms for the maximal satisfiability problem. In: Johnson, D.S., Trick, M.A. (eds.) Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, American Mathematical Society, Providence (1995)
Selman, B., Kautz, H.A.: An empirical study of greedy local search for satisfiability testing. In: AAAI 1993, pp. 46–51 (1993)
Selman, B., Kautz, H.A., Cohen, B.: Noise Strategies for Improving Local Search. In: AAAI 1994, pp. 337–343. MIT Press, Cambridge (1994)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evaluation Program. Springer, Heidelberg (1992)
Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: IJCAI 1991, pp. 331–337 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mouhoub, M., Sadaoui, S. (2004). Systematic versus Non-systematic Methods for Solving Incremental Satisfiability. In: Orchard, B., Yang, C., Ali, M. (eds) Innovations in Applied Artificial Intelligence. IEA/AIE 2004. Lecture Notes in Computer Science(), vol 3029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24677-0_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-24677-0_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22007-7
Online ISBN: 978-3-540-24677-0
eBook Packages: Springer Book Archive