论文信息 - Satisfiability Problem: Theory and Applications - 字舞流文

Satisfiability Problem: Theory and Applications

Panos M. Pardalos | Jun Gu | Ding-Zhu Du | P. Pardalos | D. Du | Jun Gu

[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

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

[3] Ming-Te Chao,et al. Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem , 1986, SIAM J. Comput..

[4] Oliver Vornberger,et al. Superlinear Speedup for Parallel Backtracking , 1987, ICS.

[5] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[6] Jun Gu,et al. Efficient local search for very large-scale satisfiability problems , 1992, SGAR.

[7] Jun Gu,et al. Local search for satisfiability (SAT) problem , 1993, IEEE Trans. Syst. Man Cybern..

[8] Hans Kleine Büning,et al. Aussagenlogik - Deduktion und Algorithmen , 1994, Leitfäden und Monographien der Informatik.

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