论文信息 - Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs

Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs

We consider the property that in a random definite Horn formula of size-3 clauses over n variables, where every such clause is included with probability p, there is a pair of variables for which forward chaining produces all other variables. We show that with high probability the property does not hold for p = (5 1n ln n)/(n ln n).

[1] Fan Chung Graham,et al. The Spectral Gap of a Random Subgraph of a Graph , 2007, Internet Math..

[2] Dhruv Mubayi,et al. Combinatorial problems for Horn clauses , 2008, ISAIM.

[3] W. T. Gowers,et al. RANDOM GRAPHS (Wiley Interscience Series in Discrete Mathematics and Optimization) , 2001 .

[4] Osamu Watanabe,et al. Propagation Connectivity of Random Hypergraphs , 2012, Electron. J. Comb..

[5] Richard M. Karp,et al. The Transitive Closure of a Random Digraph , 1990, Random Struct. Algorithms.

[6] Cristopher Moore,et al. A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas , 2005, APPROX-RANDOM.

[7] Moshe Y. Vardi,et al. The Phase Transition in the Random HornSAT Problem , 2006, Computational Complexity and Statistical Physics.

[8] Trevor J. M. Bench-Capon,et al. A sharp threshold for the phase transition of a restricted Satisfiability problem for Horn clauses , 2001, J. Log. Algebraic Methods Program..

[9] Giuseppe F. Italiano,et al. Classification and Traversal Algorithmic Techniques for Optimization Problems on Directed Hyperpaths , 2010 .

[10] Gabriel Istrate. The phase transition in random Horn satisfiability and its algorithmic implications , 1999, SODA '99.