New Methods for 3-SAT Decision and Worst-case Analysis

Abstract We prove the worst-case upper bound 1.5045..n for the time complexity of 3-SAT decision, where n is the number of variables in the input formula, introducing new methods for the analysis as well as new algorithmic techniques. We add new 2- and 3-clauses, called “blocked clauses”, generalizing the extension rule of “Extended Resolution.” Our methods for estimating the size of trees lead to a refined measure of formula complexity of 3-clause-sets and can be applied also to arbitrary trees.

[1]  Paul W. Purdom,et al.  Solving Satisfiability with Less Searching , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Allen Van Gelder,et al.  Satisfiability testing with more reasoning and less guessing , 1995, Cliques, Coloring, and Satisfiability.

[3]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[4]  J. Hooker,et al.  Branching Rules for Satissability , 1995 .

[5]  David Eppstein,et al.  3-Coloring in time O(1.3446n): A no-MIS Algorithm , 1995, Electron. Colloquium Comput. Complex..

[6]  Edward A. Hirsch,et al.  Two new upper bounds for SAT , 1998, SODA '98.

[7]  I. Schiermeyer.  Pure Literal Look Ahead: An O(1,497^n) Satisfiability Algorithm (Extended Abstract) , 1996 .

[8]  Ewald Speckenmeyer,et al.  Solving satisfiability in less than 2n steps , 1985, Discret. Appl. Math..

[9]  Allen Van Gelder,et al.  A Satisfiability Tester for Non-clausal Propositional Calculus , 1984, Inf. Comput..

[10]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[11]  Robert W. Floyd,et al.  The Language of Machines: an Introduction to Computability and Formal Languages , 1994 .

[12]  Oliver Kullmann,et al.  Deciding propositional tautologies: Algorithms and their complexity , 1997 .

[13]  Oliver Kullmann,et al.  On a Generalization of Extended Resolution , 1999, Discret. Appl. Math..

[14]  Jun Gu,et al.  Algorithms for the satisfiability (SAT) problem: A survey , 1996, Satisfiability Problem: Theory and Applications.

[15]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[16]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[17]  Oliver Kullman.  Worst-case analysis, 3-SAT decision and lower bounds: Approaches for improved SAT algorithms , 1996, Satisfiability Problem: Theory and Applications.

[18]  Jan Krajícek,et al.  Bounded arithmetic, propositional logic, and complexity theory , 1995, Encyclopedia of mathematics and its applications.

[19]  E. Ya. Dantsin.  Two systems for proving tautologies, based on the split method , 1983 .

[20]  A. V. Gelder.  Propositional Search with k-Clause Introduction Can be Polynomially Simulated by Resolution , 1997 .

[21]  Ingo Schiermeyer,et al.  Solving 3-Satisfiability in Less Then 1, 579n Steps , 1992, CSL.

[22]  Panos M. Pardalos,et al.  Satisfiability problem : theory and applications : DIMACS workshop, March 11-13, 1996 , 1997 .

[23]  Wenhui Zhang,et al.  Number of Models and Satisfiability of Sets of Clauses , 1996, Theor. Comput. Sci..

[24]  Pavel Pudlák,et al.  Satisfiability Coding Lemma , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.