|
|||||
|
|
An open research problem: strong completeness of R Kowalski's connection graph proof procedure |
|
| Authors: | Siekman, J Wrightson, G |
| Affiliation: | Z Universität des Saarlandes, Stuhlsatzenhausweg, D-66123 Saarbrücken, Germany E-mail: siekmann@dfki.de ZZ Department of Computer Science and Software Engineering, The University of Newcastle, NSW 2308, Australia E-mail: graham@cs.newcastle.edu.au |
| Abstract: | |
| Keywords: | |
| 本文献已被 Oxford 等数据库收录！ | |