PREFACE by Sir Edward Collingwood FRS v INTRODUCTION ix ABSTRACT FOUNDATIONS 1. Linear graphs and trees: H.I. SCOINS 3 2. Mathematical proofs about computer programs: D.C. COOPER 17 THEOREM PROVING 3. Beth-tree methods in automatic theorem-proving: R.J. POPPLESTONE 31 4. The resolution principle in theorem-proving: D. LUCKHAM 47 MACHINE LEARNING AND HEURISTIC PROGRAMMING 5. Tree-searching methods with an application to a network design problem: R.M. BURSTALL 65 6. Experiments with a learning component in a Go-Moku playing program: E.W. ELCOCK and A.M. MURRAY 87 7. An approach to automatic problem-solving: J. DORAN 105 8. Complete solution of the `Eight-Puzzle': P.D.A. SCHOFIELD 125 9. Strategy-building with the Graph Traverser: D. MICHIE 135 COGNITIVE PROCESSES: METHODS AND MODELS 10. Networks as models of word storage: G.R. KISS 155 11. Will seeing machines have illusions? R.L. GREGORY 169 PATTERN RECOGNITION 12. Perception, picture processing and computers: Dr M.B. CLOWES 181 13. Automatic speech recognition: a problem for machine intelligence: D.R. HILL 199 PROBLEM-ORIENTED LANGUAGES 14. Simply partitioned data structures: the compiler-compiler re-examined: R.A. BROOKER and J.S. ROHL 229 15. The third-order compiler: a context for free man-machine communication: R.B.E. NAPPER 241 16. Principles for implementing useful subsets of advanced programming languages: G.F. COULOURIS 257 17. Interrogation languages: J.M. FOSTER 267 SUBJECT INDEX 277 AUTHOR INDEX 278
Machine Intelligence 1
Publisher: Oliver and Boyd 1967
- N.L. Collins and Donald Michie
Experimental Programming Unit, University of Edinburgh
Proceedings of the First International Machine Intelligence Workshop, held at Edinburgh, September 1965. Host laboratory: Experimental Programming Unit, University of Edinburgh, UK.