论文信息 - Resolution vs. cutting plane solution of inference problems: Some computational experience - 字舞流文

Resolution vs. cutting plane solution of inference problems: Some computational experience

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

[2] John N. Hooker,et al. Generalized resolution and cutting planes , 1988 .

[3] Alasdair Urquhart,et al. Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .

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

[5] Armin Haken,et al. The Intractability of Resolution , 1985, Theor. Comput. Sci..

[6] Nils J. Nilsson,et al. Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7] Stephen A. Cook,et al. The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.

[8] Donald W. Loveland,et al. Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.

[9] Vasek Chvátal,et al. Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[10] Larry Wos,et al. Efficiency and Completeness of the Set of Support Strategy in Theorem Proving , 1965, JACM.

[11] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

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