In Meltzer, Bernard and Donald Michie (Eds.), Machine Intelligence 5. Edinburgh University Press.

In Meltzer, Bernard and Donald Michie (Eds.), Machine Intelligence 5. Edinburgh University Press.

Note: PDF of full volume downloadable by clicking on title above (32.8 MB). Selected individual chapters available from the links below.CONTENTSINTRODUCTORY MATERIALMATHEMATICAL FOUNDATIONS1 Program scheme equivalences and second-order logic. D. C. COOPER 32 Programs and their proofs: an algebraic approach.R. M. BURSTALL and P. J. LANDIN 173 Towards the unique decomposition of graphs. C. R. SNOW andH. I. SCOINS 45THEOREM PROVING4 Advances and problems in mechanical proof procedures. D. PRAWITZ 595 Theorem-provers combining model elimination and Tesolution.D. W. LOVELAND 736 Semantic trees in automatic theorem-proving. R. KOWALSKI andP. J. HAYES 877 A machine-oriented logic incorporating the equality relation.E. E. SIBERT 1038 Paramodulation and theorem-proving in first-order theories withequality. G. ROBINSON and L. Wos 1359 Mechanizing higher-order logic. J. A. ROBINSON 151DEDUCTIVE INFORMATION RETRIEVAL10 Theorem proving and information retrieval. J. L. DARLINGTON 17311 Theorem-proving by resolution as a basis for question-answeringsystems. C. CORDELL GREEN 183MACHINE LEARNING AND HEURISTIC PROGRAMMING12 Heuristic dendral: a program for generating explanatory hypothesesin organic chemistry. B. BUCHANAN, G. SUTHERLAND andE. A. FEIGENBAUM 20913 A chess-playing program. J. J. SCOTT 25514 Analysis of the machine chess game. I. J. GOOD 26715 PROSE—Parsing Recogniser Outputting Sentences in English.D. B. VIGOR, D. URQUHART and A. WILKINSON 27116 The organization of interaction in collectives of automata. 285V. I. VARSHAVSKY COGNITIVE PROCESSES: METHODS AND MODELS17 Steps towards a model of word selection. G. R. Kiss 31518 The game of hare and hounds and the statistical study of literaryvocabulary. S. H. STOREY and M. A. MAYBREY 33719 The holophone —recent developments. D. J. WILLSHAW andH. C. LONGUET-HIGGINS 349PATTERN RECOGNITION20 Pictorial relationships — a syntactic approach. M. B. CLOWES 36121 On the construction of an efficient feature space for optical characterrecognition. A. W. M. COOMBS 38522 Linear skeletons from square cupboards. C. J. HILDITCH 403PROBLEM-ORIENTED LANGUAGES23 Absys 1: an incremental compiler for assertions; an introduction.J. M. FOSTER and E. W. ELCOCK 423PRINCIPLES FOR DESIGNING INTELLIGENT ROBOTS24 Planning and generalisation in an automaton/environment system.J. E. DORAN 43325 Freddy in toyland. R. J. POPPLESTONE 45526 Some philosophical problems from the standpoint of artificialintelligence. J. MCCARTHY and P. J. HAYES 463INDEX 505 Machine Intelligence Workshop

Wiley is a global provider of content and content-enabled workflow solutions in areas of scientific, technical, medical, and scholarly research; professional development; and education. Our core businesses produce scientific, technical, medical, and scholarly journals, reference works, books, database services, and advertising; professional books, subscription products, certification and training services and online applications; and education content and services including integrated online teaching and learning resources for undergraduate and graduate students and lifelong learners. Founded in 1807, John Wiley & Sons, Inc. has been a valued source of information and understanding for more than 200 years, helping people around the world meet their needs and fulfill their aspirations. Wiley has published the works of more than 450 Nobel laureates in all categories: Literature, Economics, Physiology or Medicine, Physics, Chemistry, and Peace. Wiley has partnerships with many of the world's leading societies and publishes over 1,500 peer-reviewed journals and 1,500 new books annually in print and online, as well as databases, major reference works and laboratory protocols in STMS subjects.

"The purpose of this paper is to clarify some basic issues of choice of representation for problems of reasoning about actions. The general problem of re- Presentation is concerned with the relationship between different ways of formulating a problem to a problem solving system and the efficiency with which the system can be expected to find a solution to the problem. An understanding of the relationship between problem formulation and problem solving efficiency is a prerequisite for the design of procedures that can automatically choose the most `appropriate' representation of a problem ( they can find a `point of view' of the problem that maximally simplifies the process of finding a solution).Many problems of practical importance are problems of reasoning about actions. In these problems, a course of action has to be found that satisfies a number of specified conditions. A formal definition of this class of problems is given in the next section, in the context of a general conceptual framework for formulating these problems for computers. Everyday examples of reasoning about actions include planning an airplane trip, organizing a dinner party, etc. There are many examples of industrial and military problems in this category, such as scheduling assembly and transportation processes, designing a program for a computer, planning a military operation, etc."In D.Michie (Ed.), Machine intelligence 3. New York: American Elsevier,131-171

In Dale, E. and Michie, D. (Eds.), Machine Intelligence 2, pp. 125-133. Elsevier/North-Holland.

In E. Dale and D. Michie (Eds.), Machine intelligence 2. New York: American Elsevier, 89- 118.

Note: PDF of full volume downloadable by clicking on title above (26 MB). Selected individual chapters available from the links below. CONTENTSINTRODUCTION MATHEMATICAL FOUNDATIONS1 The morphology of prex—an essay in meta-algorithmics. J. LAS KS 32 Program schemata. M. S. PATE RSON 193 Language definition and compiler validation. J. J. FLORENTIN 334 Placing trees in lexicographic order. H. I.S COINS 43 THEOREM PROVING5 A new look at mathematics and its mechanization. B. M ELTZER 636 Some notes on resolution strategies. B. MELTZER 717 The generalized resolution principle. J. A. ROBINSON 778 Some tree-paring strategies for theorem proving. D.LUCKHAM 959 Automatic theorem proving with equality substitutions andmathematical induction. J. L. D ARLINGTON 113 MACHINE LEARNING AND HEURISTIC PROGRAMMING10 On representations of problems of reasoning about actions.S.AMAREL 13111 Descriptions. E.W.ELCOCK 17312 Kalah on Atlas. A.G.BELL 18113 Experiments with a pleasure-seeking automaton: J. E. DORAN 19514 Collective behaviour and control problems. V.I.VARSHAVSKY 217 MAN—MACHINE INTERACTION15 A comparison of heuristic, interactive, and unaided methods ofsolving a shortest-route problem. D.MICHIE, J. G. FLEMING andJ. V.OLDFIELD 24516 Interactive programming at Carnegie Tech. A.H.BOND 25717 Maintenance of large computer systems—the engineer's assistant.M.H.J.BAYLIS 269 COGNITIVE PROCESSES: METHODS AND MODELS18 The syntactic analysis of English by machine. J.P.THORNE,P.BRATLEY and H.DEWAR 28119 The adaptive memorization of sequences. H.C.LONOUETHIGGINSand A.ORTONY 311 PATTERN RECOGNITION20 An application of Graph Theory in pattern recognition.C.J.HILDITCH 325 PROBLEM-ORIENTED LANGUAGES21 Some semantics for data structures. D. PARK 35122 Writing search algorithms in functional form. R.M.BURSTALL 37323 Assertions: programs written without specifying unnecessaryorder. J.M.FOSTER 38724 The design philosophy of Pop-2. R.J.POPPLESTONE 393 INDEX 403 Machine Intelligence Workshop

Since mid-November 1966 a chess program has been under development at the Artificial Intelligence Laboratory of Project MAC at M.I.T. This paper describes the state of the program as of August 1967 and gives some of the details of the heuristics and algorithms employed.

In Dale, Ella and Donald Michie (Eds.), Machine Intelligence 2. Edinburgh University Press.