A perspective on certain polynomial-time solvable classes of satisfiability

The scope of certain well-studied polynomial-time solvable classes of Satisfiability is investigated relative to a polynomial-time solvable class consisting of what we call matched formulas. The class of matched formulas has not been studied in the literature, probably because it seems not to contain many challenging formulas. Yet, we find that, in some sense, the matched formulas are more numerous than Horn, extended Horn, renamable Horn, q-Horn, CC-balanced, or single lookahead unit resolution (SLUR) formulas.The behavior of random k-CNF formulas generated by the constant clause-width model is investigated as n and m, the numbers of variables and clauses, go to infinity. For m/n 0.64, random formulas are matched formulas with probability tending to 1. For m/nk-1 ≥ 2k/k!, random formulas are solved by a certain polynomial-time resolution procedure with probability tending to 1.The propositional connection graph is introduced to represent clause structure for formulas with general-width clauses. Cyclic substructures are exhibited that occur with high probability and prevent formulas from being in the previously studied polynomial-time solvable classes, but do not prevent them from being in the matched class. We believe that part of the significance of this work lies in guiding the future development of polynomial-time solvable classes of Satisfiability.

[1]  Klaus Truemper,et al.  Effective logic computation , 1998 .

[2]  Endre Szemerédi,et al.  Many hard examples for resolution , 1988, JACM.

[3]  David S. Johnson,et al.  Dimacs series in discrete mathematics and theoretical computer science , 1996 .

[4]  Hans Kleine Büning.  On generalized Horn formulas and k-resolution , 1993, Theor. Comput. Sci..

[5]  Irene A. Stegun,et al.  Handbook of Mathematical Functions. , 1966 .

[6]  Oliver Kullmann,et al.  Investigations on autark assignments , 2000, Discret. Appl. Math..

[7]  Andreas Goerdt.  A Threshold for Unsatisfiability , 1996, J. Comput. Syst. Sci..

[8]  John Franco.  Relative size of certain polynomial time solvable subclasses of satisfiability , 1996, Satisfiability Problem: Theory and Applications.

[9]  Milton Abramowitz,et al.  Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .

[10]  Andreas Goerdt,et al.  A Threshold for Unsatisfiability , 1992, MFCS.

[11]  John N. Hooker,et al.  Extended Horn sets in propositional logic , 1991, JACM.

[12]  P. Hall.  On Representatives of Subsets , 1935 .

[13]  Fred S. Annexstein,et al.  On Finding Solutions for Extended Horn Formulas , 1995, Inf. Process. Lett..

[14]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[15]  Maria Grazia Scutellà,et al.  Polynomially Solvable Satisfiability Problems , 1988, Inf. Process. Lett..

[16]  Michael E. Saks,et al.  On the complexity of unsatisfiability proofs for random k-CNF formulas , 1998, STOC '98.

[17]  Ewald Speckenmeyer,et al.  An Algorithm for the Class of Pure Implicational Formulas , 1999, Discret. Appl. Math..

[18]  John Franco,et al.  Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem , 1983, Discret. Appl. Math..

[19]  Stephen A. Cook,et al.  On the complexity of proof systems , 1996 .

[20]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[21]  Nathan Linial,et al.  Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas , 1986, J. Comb. Theory, Ser. A.

[22]  Béla Bollobás,et al.  Random Graphs , 1985 .

[23]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[24]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[25]  Maria Grazia Scutellà,et al.  A Note on Dowling and Gallier's Top-Down Algorithm for Propositional Horn Satisfiability , 1990, J. Log. Program..

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

[27]  Alon Itai,et al.  On the complexity of time table and multi-commodity flow problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[28]  Bruce A. Reed,et al.  Mick gets some (the odds are on his side) (satisfiability) , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[29]  Craig A. Tovey,et al.  A simplified NP-complete satisfiability problem , 1984, Discret. Appl. Math..

[30]  Alan M. Frieze,et al.  Analysis of Two Simple Heuristics on a Random Instance of k-SAT , 1996, J. Algorithms.

[31]  Bengt Aspvall,et al.  Recognizing Disguised NR(1) Instances of the Satisfiability Problem , 1980, J. Algorithms.

[32]  Ming-Te Chao,et al.  Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem , 1990, Inf. Sci..

[33]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[34]  Harry R. Lewis,et al.  Renaming a Set of Clauses as a Horn Set , 1978, JACM.

[35]  Hans van Maaren,et al.  A Short Note on Some Tractable Cases of the Satisfiability Problem , 2000, Inf. Comput..

[36]  Mukesh Dalal,et al.  A Hierarchy of Tractable Satisfiability Problems , 1992, Inf. Process. Lett..

[37]  Robert A. Kowalski,et al.  A Proof Procedure Using Connection Graphs , 1975, JACM.

[38]  Endre Boros,et al.  Recognition of q-Horn Formulae in Linear Time , 1994, Discret. Appl. Math..

[39]  Michael E. Saks,et al.  A Complexity Index for Satisfiability Problems , 1994, IPCO.

[40]  Alan M. Frieze,et al.  On the satisfiability and maximum satisfiability of random 3-CNF formulas , 1993, SODA '93.