Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets
暂无分享,去创建一个
[1] John McCarthy,et al. Programs with common sense , 1960 .
[2] Paul C. Gilmore,et al. A Proof Method for Quantification Theory: Its Justification and Realization , 1960, IBM J. Res. Dev..
[3] James R. Slagle. Interpolation Theorems for Resolution in Lower Predicate Calculus , 1970, JACM.
[4] Chin-Liang Chang. Renamable Paramodulation for Automatic Theorem Proving with Equality , 1970, Artif. Intell..
[5] Journal of the Association for Computing Machinery , 1961, Nature.
[6] Jane J. Robinson. A review of automatic theorem-proving , 1967 .
[7] Robert Anderson. Completeness results for e-resolution , 1970, AFIPS '70 (Spring).
[8] Hans Hermes,et al. Introduction to mathematical logic , 1973, Universitext.
[9] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.
[10] Bertram Raphael,et al. The use of theorem-proving techniques in question-answering systems , 1968, ACM National Conference.
[11] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[12] Jared L. Darlington. Theorem Provers as Question Answerers , 1969, IJCAI.
[13] Larry Wos,et al. Efficiency and Completeness of the Set of Support Strategy in Theorem Proving , 1965, JACM.
[14] L. Wos,et al. The unit preference strategy in theorem proving , 1899, AFIPS '64 (Fall, part I).
[15] James R. Slagle. Artificial intelligence : the heuristic programming approach , 1971 .
[16] James R. Slagle,et al. Automatic Theorem Proving With Renamable and Semantic Resolution , 1967, JACM.