A sharp threshold for the renameable-Horn and the q-Horn properties

The sharp Satisfiability threshold is well known for random k-SAT formulas and is due to certain minimality and monotonic properties mentioned in this manuscript and reported in Chandru and Hooker [J. Assoc. Comput. Mach. 38 (1991) 205-221]. Whereas the Satisfiability threshold is on the probability that a satisfying assignment exists, we find that sharp thresholds also may be determined for certain formula structures, for example, the probability that a particular kind of cycle exists in a random formula. Such structures often have a direct relationship on the hardness of a formula because it is often the case that the presence of such a structure disallows a formula from a known, easily solved class of Satisfiability problems. We develop tools that should assist in determining threshold sharpness for a variety of applications. We use the tools to show a sharp threshold for the q-Horn and renameable-Horn properties.

[1]  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.

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

[3]  Allen Van Gelder,et al.  A perspective on certain polynomial-time solvable classes of satisfiability , 2003, Discret. Appl. Math..

[4]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[5]  R. Zecchina,et al.  Phase transitions in combinatorial problems , 2001 .

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

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

[8]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

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

[10]  Michael Molloy,et al.  Models for Random Constraint Satisfaction Problems , 2003, SIAM J. Comput..

[11]  Michael Krivelevich,et al.  Sharp thresholds for certain Ramsey properties of random graphs , 2000, Random Struct. Algorithms.

[12]  Jean-Jacques Hébrard.  A Linear Algorithm for Renaming a Set of Clauses as a Horn Set , 1994, Theor. Comput. Sci..

[13]  Cristopher Moore,et al.  The asymptotic order of the random k-SAT threshold , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[14]  Lefteris M. Kirousis,et al.  The probabilistic analysis of a greedy satisfiability algorithm , 2002, Random Struct. Algorithms.

[15]  Armin Biere,et al.  Bounded Model Checking Using Satisfiability Solving , 2001, Formal Methods Syst. Des..

[16]  M. Mitzenmacher.  Tight Thresholds for The Pure Literal Rule , 1997 .

[17]  Rémi Monasson,et al.  Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.

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

[19]  Olivier Dubois,et al.  Typical random 3-SAT formulae and the satisfiability threshold , 2000, SODA '00.

[20]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[21]  Nadia Creignou,et al.  Combinatorial sharpness criterion and phase transition classification for random CSPs , 2004, Inf. Comput..

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

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

[24]  Nadia Creignou,et al.  Generalized satisfiability problems: minimal elements and phase transitions , 2003, Theor. Comput. Sci..

[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]  Miklós Simonovits,et al.  Supersaturated graphs and hypergraphs , 1983, Comb..

[27]  E. Friedgut,et al.  Sharp thresholds of graph properties, and the -sat problem , 1999 .

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