论文信息 - The SAT phase transition

The SAT phase transition

Phase transition is an important feature of SAT problem. For randomk-SAT model, it is proved that asr (ratio of clauses to variables) increases, the structure of solutions will undergo a sudden change like satisfiability phase transition whenr reaches a threshold point (r=rσ). This phenomenon shows that the satisfying truth assignments suddenly shift from being relatively different from each other to being very similar to each other.

Wei Li | Ke Xu | Wei Li | Ke Xu

[1] Li Wei. A mathematic-physical approach to the satisfiability problem , 1995 .

[2] L. Kirousis,et al. Approximating the unsatisfiability threshold of random formulas , 1998 .

[3] Yacine Boufkhad,et al. A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae , 1997, J. Algorithms.

[4] Bart Selman,et al. Critical Behavior in the Computational Cost of Satisfiability Testing , 1996, Artif. Intell..

[5] Yannis C. Stamatiou,et al. Approximating the unsatisfiability threshold of random formulas , 1998, Random Struct. Algorithms.

[6] Toby Walsh,et al. Local Search and the Number of Solutions , 1996, CP.

[7] Toby Walsh,et al. The SAT Phase Transition , 1994, ECAI.

[8] Tad Hogg,et al. Phase Transitions and the Search Problem , 1996, Artif. Intell..