论文信息 - Programming in Propositional Logic or Reductions: Back to the Roots (Satisfiability)

Programming in Propositional Logic or Reductions: Back to the Roots (Satisfiability)

In this paper, NP-complete and polynomial solvable problems are reduced to the SAT-ISFIABILITY problem. We call this process \programming" in propositional logic. On the one hand, the programs (propositional formulas) derived by this process build a rich pool of easy and hard (non-random) formulas for SATISFIABILITY-solving heuristics. On the other hand, the implementations (programs) give rise to new heuristics for solving SATISFIABILITY.

Hermann Stamm-Wilbrandt

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

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3] Olivier Dubois,et al. On the r, s-SAT satisfiability problem and a conjecture of Tovey , 1989, Discret. Appl. Math..

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

[5] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[6] Johan de Kleer,et al. An Assumption-Based TMS , 1987, Artif. Intell..

[7] M.N.S. Swamy,et al. Planar embedding: linear-time algorithms for vertex placement and edge orderings , 1988 .