Abstract
We present an improved algorithm for the general satisfiability problem. We introduce a new measure, the l-value, for a Boolean formula \(\cal F\), which is defined based on weighted variable frequencies in the formula \(\cal F\). We then develop a branch-and-search algorithm for the satisfiability problem that tries to maximize the decreasing rates in terms of the l-value during the branch-and-search process. The complexity of the algorithm in terms of the l-value is finally converted into the complexity in terms of the total length L of the input formula, resulting in an algorithm of running time O(20.0911L) = O(1.0652L) for the satisfiability problem, improving the previous best upper bound O(20.0926L) = O(1.0663L) for the problem.
This work was supported in part by the National Science Foundation under the Grant CCF-0830455.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. Journal of Algorithms 41, 280–301 (2001)
Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7, 201–215 (1960)
Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: a simple O(20.288n) independent set algorithm. In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 18–25 (2006)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.Freeman and Company, New York (1979)
Van Gelder, A.: A satisfiability tester for non-clausal propositional claculus. Information and Computation 79, 1–21 (1988)
Gu, J., Purdom, P., Wah, W.: Algorithms for the satisfiability (SAT) problem: A survey. In: Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, pp. 19–152 (1997)
Hirsh, E.: Two new upper bounds for SAT. In: Proc. 9th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 521–530 (1998)
Hirsh, E.: New Worst-Case Upper Bounds for SAT. Journal of Automated Reasoning 24, 397–420 (2000)
Kullmann, O., Luckhardt, H.: Deciding propositional tautologies: Algorithms and their complexity (manuscript) (1997)
Schöning, U.: Algorithmics in exponential time. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 36–43. Springer, Heidelberg (2005)
Wahlström, M.: An algorithm for the SAT problem for formulae of linear length. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 107–118. Springer, Heidelberg (2005)
Wahlstöm, M.: Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 309–323. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, J., Liu, Y. (2009). An Improved SAT Algorithm in Terms of Formula Length. In: Dehne, F., Gavrilova, M., Sack, JR., Tóth , C.D. (eds) Algorithms and Data Structures. WADS 2009. Lecture Notes in Computer Science, vol 5664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03367-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-03367-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03366-7
Online ISBN: 978-3-642-03367-4
eBook Packages: Computer ScienceComputer Science (R0)