A Linear Deduction System with Integrated Semantic Guidance
作者： Geoff Sutcliffe
DOI:
关键词: Computer science
摘要:
参考文章(104)
Donald F. Geddis, Matthew L. Ginsberg, Is there any need for domain-dependent control information? national conference on artificial intelligence. pp. 452- 457 ,(1991)
Christoph Walther, Unification in many-sorted theories european conference on artificial intelligence. pp. 383- 392 ,(1984)
Manfred Schmidt-Schauß, A Many-Sorted Calculus with Polymorphic Functions Based on Resolution and Paramodulation. international joint conference on artificial intelligence. pp. 1162- 1168 ,(1985)
Herbert L. Gelernter, Realization of a geometry theorem proving machine. ifip congress. pp. 273- 281 ,(1959)
W. W. Bledsoe, Some Thoughts on Proof Discovery. SLP. pp. 2- 10 ,(1986)
W. W. Bledsoe, Using examples to generate instantiations of set variables international joint conference on artificial intelligence. pp. 892- 901 ,(1983)
J. A. Robinson, Automatic Deduction with Hyper-Resolution Springer Berlin Heidelberg. pp. 416- 423 ,(1983) , 10.1007/978-3-642-81952-0_27
Mark E. Stickel, W. Mabry Tyson, An analysis of consecutively bounded depth-first search with applications in automated deduction international joint conference on artificial intelligence. pp. 1073- 1075 ,(1985)
K. B. Irani, D. G. Shin, A many-sorted resolution based on an extension of a first-order language international joint conference on artificial intelligence. pp. 1175- 1177 ,(1985)
Allen Newell, Herbert A Simon, None, Computer science as empirical inquiry: symbols and search (1976) Perspectives on the computer revolution. pp. 109- 133 ,(1989)