The Complexity of Gentzen Systems for Propositional Logic
暂无分享,去创建一个
[1] Stephen A. Cook,et al. Feasibly constructive proofs and the propositional calculus (Preliminary Version) , 1975, STOC.
[2] Armin Haken,et al. The Intractability of Resolution , 1985, Theor. Comput. Sci..
[3] G. S. Tseitin. On the Complexity of Derivation in Propositional Calculus , 1983 .
[4] Bernard Harris,et al. Theory of Probability , 1967 .
[5] Stephen A. Cook,et al. The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.
[6] Stephen Cook,et al. Corrections for "On the lengths of proofs in the propositional calculus preliminary version" , 1974, SIGA.
[7] Mordechai Ben-Ari,et al. A Simplified Proof That Regular Resolution is Exponential , 1980, Inf. Process. Lett..
[8] R. Statman. Bounds for proof-search and speed-up in the predicate calculus , 1978 .
[9] Zvi Galil,et al. On the Complexity of Regular Resolution and the Davis-Putnam Procedure , 1977, Theor. Comput. Sci..
[10] Hao Wang,et al. Toward Mechanical Mathematics , 1960, IBM J. Res. Dev..
[11] A. O. Slisenko,et al. An Algorithm for a Machine Search of a Natural Logical Deduction in a Propositional Calculus , 1983 .