论文信息 - A Dual Algorithm for the Satisfiability Problem

A Dual Algorithm for the Satisfiability Problem

Abstract SAT can be regarded as a problem to decide whether its dual disjunctive form can be simplified to 1. We propose a simple dual algorithm that improves estimates of the degree of the unsatisfiability by orthogonalization. For random satisfiability problems, our algorithm is well behaved with a preconditioning by some parts of the Davis-Putnam procedure.

Yoshihiro Tanaka

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

[2] J. Hooker. Resolution vs. cutting plane solution of inference problems: Some computational experience , 1988 .

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

[4] Kazuo Iwama,et al. CNF Satisfiability Test by Counting and Polynomial Average Time , 1989, SIAM J. Comput..

[5] John V. Franco,et al. On the Probabilistic Performance of Algorithms for the Satisfiability Problem , 1986, Inf. Process. Lett..

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

[7] Purdom Paul. Random Satisfiability Problems , 1989 .

[8] John N. Hooker,et al. A quantitative approach to logical inference , 1988, Decis. Support Syst..

[9] J. K. Lowe,et al. Some results and experiments in programming techniques for propositional logic , 1986, Comput. Oper. Res..

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