论文信息 - Boosting complete techniques thanks to local search methods

Boosting complete techniques thanks to local search methods

In this paper, an efficient heuristic allowing one to localize inconsistent kernels in propositional knowledge‐bases is described. Then, it is shown that local search techniques can boost the performance of logically complete methods for SAT. More precisely, local search techniques can be used to guide the branching strategy of logically complete techniques like Davis and Putnam's one, giving rise to significant performance improvements, in particular when addressing locally inconsistent problems. Moreover, this approach appears very competitive in the context of consistent SAT instances, too.

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

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

[3] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.

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

[5] Jacques Carlier,et al. SAT versus UNSAT , 1993, Cliques, Coloring, and Satisfiability.

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

[7] Stephen A. Cook,et al. A short proof of the pigeon hole principle using extended resolution , 1976, SIGA.

[8] Lakhdar Sais,et al. Tabu Search for SAT , 1997, AAAI/IAAI.

[9] Bart Selman,et al. Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.

[10] Jacques Carlier,et al. Probabilistic approach to the Satisfiability Problem , 1991, Theor. Comput. Sci..

[11] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[12] Toby Walsh,et al. Towards an Understanding of Hill-Climbing Procedures for SAT , 1993, AAAI.

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

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