Deduction Plans: A Basis for Intelligent Backtracking
暂无分享,去创建一个
[1] Lewis Denver Baxter. The complexity of unification. , 1976 .
[2] Mike Paterson,et al. Linear unification , 1976, STOC '76.
[3] Peter B. Andrews. Refutations by Matings , 1976, IEEE Transactions on Computers.
[4] James R. Slagle,et al. Using Rewriting Rules for Connection Graphs to Prove Theorems , 1979, Artif. Intell..
[5] Robert E. Shostak. Refutation Graphs , 1976, Artif. Intell..
[6] D. Loveland. A Linear Format for Resolution , 1970 .
[7] Donald W. Loveland,et al. Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.
[8] Robert A. Kowalski,et al. Linear Resolution with Selection Function , 1971, Artif. Intell..
[9] Donald W. Loveland,et al. Mechanical Theorem-Proving by Model Elimination , 1968, JACM.
[10] S BoyerRoger,et al. Ttle sharing of structure in theorem proving programs , 1972 .
[11] Robert A. Kowalski,et al. A Proof Procedure Using Connection Graphs , 1975, JACM.
[12] Gérard Huet,et al. Constrained resolution: a complete method for higher-order logic. , 1972 .
[13] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.
[14] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .
[15] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.
[16] Sharon Sickel,et al. A Search Technique for Clause Interconnectivity Graphs , 1976, IEEE Transactions on Computers.
[17] Timothy P. Hart,et al. Resolution Graphs , 1970, Artif. Intell..
[18] D. Luckham. Refinement Theorems in Resolution Theory , 1970 .