论文信息 - Tautology Testing with a Generalized Matrix Reduction Method

Tautology Testing with a Generalized Matrix Reduction Method

Abstract A formalization of the tautology problem in terms of matrices is given. From that a generalized matrix reduction method is derived. Its application to a couple of selected examples indicates a relatively efficient behaviour in testing the validity of a given formula in propositional logic—not only for machines but also for humans. A further result from that formalization is a reduction of the tautology problem to a part of Presburger arithmetic which involves formulas of the ∀∃∃⋯∃-type where all quantifiers have finite range.

Wolfgang Bibel

[1] Hao Wang,et al. Towards feasible solutions of the tautology problem , 1976 .

[2] M. Fischer,et al. SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC , 1974 .

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

[4] Robert S. Boyer,et al. Computer Proofs of Limit Theorems , 1971, IJCAI.

[5] Lawrence J. Henschen,et al. Theorem Proving by Covering Expressions , 1979, JACM.

[6] Wolfgang Bibel. A syntactic connection between proof procedures and refutation prcedures , 1977, Theoretical Computer Science.

[7] W. W. Bledsoe,et al. Non-Resolution Theorem Proving , 1977, Artif. Intell..

[8] A. J. Nevins,et al. A Human Oriented Logic for Automatic Theorem-Proving , 1974, JACM.

[9] A. Slisenko. Studies in constructive mathematics and mathematical logic , 1969 .

[10] Stephen Cook,et al. Corrections for "On the lengths of proofs in the propositional calculus preliminary version" , 1974, SIGA.

[11] Dag Prawitz,et al. A proof procedure with matrix reduction , 1970 .

[12] Z. Galil. The Complexity of Resolution Procedures for Theorem Proving in the Propositional Calculus , 1975 .