DOCSLIB.ORG

Bfm:978-3-642-97005-4/1.Pdf

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Bfm:978-3-642-97005-4/1.Pdf W F. Clocksin C. S. Mellish Programming in Prolog Third, Revised and Extended Edition Spri nger-Verlag Berlin Heidelberg New York London Paris Tokyo William F. Clocksin Computer Laboratory, University of Cambridge Corn Exchange Street Cambridge CB2 3QG/Engiand Christopher S. Mellish Cognitive Studies Programme, University of Sussex Arts Building, Falmer Brighton BN1 9QN/Engiand ISBN-13: 978-3-540-17539-1 e-ISBN-13: 978-3-642-97005-4 DOl: 10.1007/978-3-642-97005-4 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in other ways, and storage in data banks. Duplication of this publication or parts thereof is only permitted under the provisions of the German Copyright Law of September 9,1965, in its version of June 24,1985, and a copyright fee must always be paid. Violations fall under the prosecution act of the German Copyright Law. © Springer-Verlag Berlin Heidelberg 1981, 1984, 1987 PREFACE TO THE THIRD EDITION We have added new material to Chapter 3 to give an account of up-to-date programming techniques using accumulators and difference structures. Chapter 8 contains some new information on syntax errors. Operator precedences are now compatible with the most widely-used implementations. We have made further reorganisations and improvements in presentation, and have corrected a number of minor errors. We thank the many people who brought typographical errors in the previous edition to our attention, and we thank A.R.C. for careful proofreading. Cambridge, England W.F.C. January,1987 C.S.M. PREFACE TO THE SECOND EDITION (1984) Since the first publishing of Programming in Prolog in 1981, Prolog has continued to attract an unexpectedly great deal of interest in the computer science community and is now seen as a potential basis for an important new generation of programming languages and systems. We hope that Programming in Prolog has partially satisfied the increasing need for an easy, yet comprehensive introduction to the language as a tool for practical programming. In this second edition we have taken the opportunity to improve the presentation and to correct various minor errors in the original. We thank the many people who have given us suggestions for corrections and improvement. Cambridge, England W.F.C. August, 1984 C.S.M. PREFACE TO THE FIRST EDITION (1981) The computer programming language Prolog is quickly gaining popularity throughout the world. Since its beginnings around 1970, Prolog has been chosen by many programmers for applications of symbolic computation, including: o relational databases o mathematical logic o abstract problem solving o understanding natural language o design automation o symbolic equation solving o biochemical structure analysis o many areas of artificial intelligence Until now, there has been no textbook with the aim of teaching Prolog as a practical programming language. It is perhaps a tribute to Prolog that so many people have been motivated to learn it by referring to the necessarily concise reference manuals, a few published papers, and by the orally transmitted "folklore" of the modern computing community. However, as Prolog is beginning to be introduced to large numbers of undergraduate and postgraduate students, many of our colleagues have expressed a great need for a tutorial guide to learning Prolog. We hope this little book will go some way towards meeting this need. Many newcomers to Prolog find that the task of writing a Prolog program is not like specifying an algorithm in the same way as in a conventional programming language. Instead, the Prolog programmer asks more what formal relationships and objects occur in his problem, and what relationships are "true" about the desired solution. So, Prolog can be viewed as a descriptive language as well as a prescriptive one. The Prolog approach is rather to describe known facts and relationships about a problem, than to prescribe the sequence of steps taken by a computer to solve the problem. When a computer is programmed in Prolog, the actual way the computer carries out the computation is specified partly by the logical declarative semantics of Prolog, partly by what new facts Prolog can "infer" from the given ones, and only partly by explicit control information supplied by the programmer. VIII PREFACE Prolog is a practical and efficient implementation of many aspects of "intelligent" program execution, such as non-determinism, parallelism, and pattern-directed procedure call. Prolog provides a uniform data structure, called the term, out of which all data, as well as Prolog programs, are constructed. A Prolog program consists of a set of clauses, where each clause is either a fact about the given information or a rule about how the solution may relate to or be inferred from the given facts. Thus, Prolog can be seen as a first step towards the ultimate goal of programming in logic. In this book we shall not be concerned greatly with the wider implications of logic programming or with why Prolog is not the ultimate logic programming language. Instead, we will be concerned with showing how useful programs can be written using the Prolog systems that exist today. This book can serve several purposes. The aim of this book is not to teach the art of programming as such. We feel that programming cannot be learned simply by reading a book or by listening to a lecturer. You've got to do programming to learn it. We hope that beginners without a mathematical background can learn Prolog from this book, although in this case we would recommend that the beginner is taught by a programmer who knows Prolog, as part of a course that introduces the student to programming as such. It is assumed that the beginner can obtain the use of a computer that has a Prolog system installed, and that he has been instructed in the use of a computer terminal. The experienced programmer should not require extra assistance, but we hope he will not dismay at our efforts to restrain mathematical affectation. We have used draft versions of this book to teach university graduates who did little mathematics as schoolchildren, and who specialised in philosophy and psychology whilst at university. In our experience, novice programmers find that Prolog programs seem to be more comprehensible than equivalent programs in conventional languages. However, the same people tend not to appreciate the limitations that conventional languages place on their use of computing resources. On the other hand, the programmer experienced in conventional languages is better prepared to deal with abstract concepts such as variables and control flow. But, in spite of his prior experience, he may find Prolog difficult to adapt to, and he may need a lot of convincing before he considers Prolog a useful programming tool. Of course, we know of many highly experienced programmers who have taken up Prolog with much enthusiasm. However, the aim of this book is not to convert, but to teach. Like most other programming languages, Prolog exists in a number of different implementations, each with its own semantic and syntactic peculiarities. In this book we have adopted a "core Prolog", and all of our examples conform to a standard version that corresponds to the implementations, developed mainly at Edinburgh, for several different computer systems: the DECsystem-lO running TOPS-IO, the DEC VAX and PREFACE IX PDP-11 running Unix, the DEC LSI-11 running RT-11, and the ICL 2980 running EMAS. The implementations for the DEC computers are probably the most widespead. All the examples in this book will run on all of the implementations. In the appendices, we list some of the existing Prolog implementations, indicating how they diverge from the standard. The reader will appreciate that most of the deviations are of a purely cosmetic nature. This book was designed to be read sequentially, although it will prove helpful to read Chapter 8 at the time the reader begins to write Prolog programs consisting of more than about ten clauses. Furthermore, it is wise to read the appropriate appendix that describes the particular implementation of Prolog. Appendices tell how to enter clauses, what debugging facilities are available, and other practical matters. It shouldn't hurt to browse through the book, but do take care not to skip over the earlier chapters. Each chapter is divided into several sections, and we advise the reader to attempt the exercises that are at the end of many sections. The solutions to some of the exercises appear at the end of the book. Chapter 1 is a tutorial introduction that is intended to give the reader a "feel" for what is required to program in Prolog. The fundamental ideas of Prolog are introduced, and the reader is advised to study them carefully. Chapter 2 presents a more complete discussion of points that are introduced in Chapter 1. Chapter 3 deals with data structures and derives some small example programs. Chapter 4 treats the subject of backtracking in more detail, and introduces the "cut" symbol, which is used to control backtracking. Chapter 5 introduces the facilities that are available for input and output. Chapter 6 describes each built-in predicate in the standard "core" of Prolog. Chapter 7 is a potpourri of example programs collected from many sources, together with an explanation of how they are written. Chapter 8 offers some advice on debugging Prolog programs. Chapter 9 introduces the Grammar Rule syntax, and examines the design decisions for some aspects of analysing natural language by using Grammar Rules. Chapter 10 describes the relation of Prolog to its origins in mathematical theorem proving and logic programming.
Load more

Recommended publications
  • PDF (Ved-Editor+Html2pdf)
    Free, Revised (slightly extended), Version of 1978 Book (goo.gl/AJLDih) HTML and PDF Afterthoughts (2015 onwards): Minor updates: 2018, Feb 2019, Jun 2019 PDF version with contents list in side-panel (if supported by viewer). PDF page numbers may change after further editing -- so don’t use them for reference! (5 Sep 2017: increased font size) JUMP TO TABLE OF CONTENTS 1978 Book Cover I was not consulted about the cover. The book is mainly concerned with the biological, psychological and philosophical significance of virtual machinery. I did not know that the publishers had decided to associate it with paper tape devices until it was published. 1 1978 First Page Copyright: Aaron Sloman, 1978 (When the book went out of print all rights reverted to the author.) 2015: I hereby permit anyone to copy any or all of the contents of this book. The online version of this work is licensed under a Creative Commons Attribution 4.0 International License. If you use, or comment on, any of this please include a URL if possible, so that readers can see the original (or the latest version). For more freely available online books see http://onlinebooks.library.upenn.edu/ JUMP TO TABLE OF CONTENTS 2 Original front-matter -- 1978 HARVESTER STUDIES IN COGNITIVE SCIENCE General Editor: Margaret A. Boden Harvester Studies in Cognitive Science is a new series which will explore the nature of knowledge by way of a distinctive theoretical approach one that takes account of the complex structures and interacting processes that make thought and action possible. Intelligence can be studied from the point of view of psychology, philosophy, linguistics, pedagogy and artificial intelligence, and all these different emphases will be represented within the series.
    [Show full text]
  • Growing the Artificial Intelligence Industry in the Uk
    GROWING THE ARTIFICIAL INTELLIGENCE INDUSTRY IN THE UK Professor Dame Wendy Hall and Jérôme Pesenti Growing the Artificial Intelligence Industry in the UK FOREWORD We are grateful to the Business Secretary and Culture Secretary for asking us to conduct this Review of how to grow Artificial Intelligence in the UK, in terms of those developing it and deploying it. We believe that this is the right time for the UK to accelerate on AI, and ensure that our unique history of ground breaking research bears fruit in the social and economic benefits that the technology offers. We are at the threshold of an era when much of our productivity and prosperity will be derived from the systems and machines we create. We are accustomed now to technology developing fast, but that pace will increase and AI will drive much of that acceleration. The impacts on society and the economy will be profound, although the exact nature of those impacts is uncertain. We are convinced that because of the UK’s current and historical strengths in this area we are in a strong position to lead rather than follow in both the development of the technology and its deployment in all sectors of industry, education and government. We have a choice. The UK could stay among the world leaders in AI in the future, or allow other countries to dominate. We start from a good position in many respects but other leading countries are devoting significant resources to growing and deploying AI. The UK will need to act in key areas and to sustain action over a long period and across industry sectors, to retain its world leading status, and to grow our AI capability as well as deploying it much more widely.
    [Show full text]
  • The History of Standard ML
    The History of Standard ML DAVID MACQUEEN, University of Chicago, USA ROBERT HARPER, Carnegie Mellon University, USA JOHN REPPY, University of Chicago, USA Shepherd: Kim Bruce, Pomona College The ML family of strict functional languages, which includes F#, OCaml, and Standard ML, evolved from the Meta Language of the LCF theorem proving system developed by Robin Milner and his research group at the University of Edinburgh in the 1970s. This paper focuses on the history of Standard ML, which plays a central rôle in this family of languages, as it was the first to include the complete set of features that we now associate with the name “ML” (i.e., polymorphic type inference, datatypes with pattern matching, modules, exceptions, and mutable state). Standard ML, and the ML family of languages, have had enormous influence on the world of programming language design and theory. ML is the foremost exemplar of a functional programming language with strict evaluation (call-by-value) and static typing. The use of parametric polymorphism in its type system, together with the automatic inference of such types, has influenced a wide variety of modern languages (where polymorphism is often referred to as generics). It has popularized the idea of datatypes with associated case analysis by pattern matching. The module system of Standard ML extends the notion of type-level parameterization to large-scale programming with the notion of parametric modules, or functors. Standard ML also set a precedent by being a language whose design included a formal definition with an associated metatheory of mathematical proofs (such as soundness of the type system).
    [Show full text]
  • Edit Summer 2009
    SUMMER 09 THE ALUMNI MAGAZINE INCLUDING BILLET & GENERAL COUNCIL PAPERS The Origin of Genius Charles Darwin’s Edinburgh connection ALSO INSIDE Edinburgh’s innovative teaching leads the way Edit meets the winners of the Principal’s Medal The University of Edinburgh Forever a part of it Your links with Edinburgh don’t end when you leave the University – you’re an Edinburgh alumnus for life – so stay in touch and reap the benefits! The Alumni Card What will it do for you? Have you got your new-look Alumni Card • Receive 15% off hire of University • Enjoy free access to the University’s yet? As an alumnus you are eligible for the venues, accommodation and catering many libraries and their printed new card, which replaces the Edinburgh for weddings, parties, meetings and, collections – as well as 50% off Passport and allows discounted access of course, reunions! borrowing rights. to many of the University’s outstanding • Enjoy a 25% discount at the • Receive a 20% discount on all books facilities. The card also entitles you to University’s Centre for Sports and published by Edinburgh University a new range of discounts with partner Exercise – one of the Scotsman’s Press. organisations worldwide. Sign up at top five gyms in Scotland – which Get discounted rates with our partners www.ed.ac.uk/alumni. • offers you a wealth of fitness in the hotel and leisure industry all over classes, training, gym support, the world. We will be adding to our list climbing facilities, a circuit gym, of partners on a regular basis, so make playing fields, an outdoor activity sure you visit www.ed.ac.uk/alumni centre on Loch Tay and much more! for the latest offers.
    [Show full text]
  • Spring 2004 Significant
    F MAS O SA Y C IT H S U R S E E V T I T N S U U n i v e r s i t y o f Massachusetts A m h e r s t A 3 M 6 H 18 E RS T • Spring 2004 Significant Newsletter of the Department of Computer Science BITS FACULTY Multi-agent vehicle tracking system David Kulp joins faculty chosen for demonstration page 3 major research focus of the Multi-Agent Systems Laboratory (MAS) over the last IN MEMORIAM four years has been the development of an adaptive distributed sensor network of low-cost A radar sensors for vehicle tracking as part of the DARPA Autonomous Negotiating Teams Robin Popplestone, (ANTs) program. The UMass team was one of two teams chosen out of the original five teams to demonstrate their system at the end of the program. “This sensor network application was Emeritus Professor extremely interesting and challenging because of its requirement to make effective coordination page 5 and resource allocation decisions in soft real-time and in low-communication-bandwidth envi- ronments, while dealing with issues of scale,” said Professor Victor Lesser, Director of MAS. “It Ronnie Boss, Grant also provided an opportunity to verify the practical applicability of some of the technology that Administrator the MAS lab has been developing over the last 10 years to real-world problems.” page 5 The sensor platform in the ANTs program provides 360-degree range from three, 120-degree scanning radars – only one of these radars can be active at a time (see Figure 1, top left).
    [Show full text]
  • The Language List - Version 2.4, January 23, 1995
    The Language List - Version 2.4, January 23, 1995 Collected information on about 2350 computer languages, past and present. Available online as: http://cui_www.unige.ch/langlist ftp://wuarchive.wustl.edu/doc/misc/lang-list.txt Maintained by: Bill Kinnersley Computer Science Department University of Kansas Lawrence, KS 66045 [email protected] Started Mar 7, 1991 by Tom Rombouts <[email protected]> This document is intended to become one of the longest lists of computer programming languages ever assembled (or compiled). Its purpose is not to be a definitive scholarly work, but rather to collect and provide the best information that we can in a timely fashion. Its accuracy and completeness depends on the readers of Usenet, so if you know about something that should be added, please help us out. Hundreds of netters have already contributed to this effort. We hope that this list will continue to evolve as a useful resource available to everyone on the net with an interest in programming languages. "YOU LEFT OUT LANGUAGE ___!" If you have information about a language that is not on this list, please e-mail the relevant details to the current maintainer, as shown above. If you can cite a published reference to the language, that will help in determining authenticity. What Languages Should Be Included The "Published" Rule - A language should be "published" to be included in this list. There is no precise criterion here, but for example a language devised solely for the compiler course you're taking doesn't count. Even a language that is the topic of a PhD thesis might not necessarily be included.
    [Show full text]
  • Quarterly No.125
    Quarterly No.125 The Newsletter of the Society for the Study of Artificial Intelligence and Simulation of Behaviour In this issue: Features Three-Dimensional • Daniel Myatt and Slavomir Nasuto 1 Three Dimensional Recon- Reconstruction of Neurons struction of neurons • Nicholas Jennings 3 with Neuromantic Decentralised Control of Complex Systems • Austin Tate 7 Despite the tendency of traditional artificial neural nected cylinders of varying radius and length. The Planning and Doing Things networks to simplify the role of dendritic and axonal tree is thus stored as a series of points, where each morphology to simple connections between neurons, point is associated with a 3D position and radius, as Society in reality neurites have an important role to play in well as having a corresponding ‘parent point’. From • AISB Symposia 9 determining neuronal behaviour. For example, the such a model, the behaviour of the neuron may be AISB’08 and call for pro- posals for AISB’09 diameter significantly affects the oscillatory behaviour estimated using a compartmental simulator such as of a neurite. Similarly, signals take time to travel NEURON [2] or GENESIS [3]. Also, it is possible Reviews down the length of dendrites, adding a spatiotemporal to calculate a variety of useful statistics from such • Ariel Procaccia 9 Cooperative Information characteristic into neuronal operation. models to either classify them or differentiate between Agents a control and experimental group. Father Hacker There are two main motivations for the creation • Computational Theology 12 of models of neuronal morphology. Primarily, such The raw data required for a reconstruction is a models are required in order to investigate the role stack comprised of a series of images taken of the that the morphology of a neuron plays in determin- tissue sample at varying distances away from the ing function by allowing validation of computational microscope lens.
    [Show full text]
  • History of Interactive Theorem Proving
    HISTORY OF INTERACTIVE THEOREM PROVING John Harrison, Josef Urban and Freek Wiedijk Reader: Lawrence C. Paulson 1 INTRODUCTION By interactive theorem proving, we mean some arrangement where the machine and a human user work together interactively to produce a formal proof. There is a wide spectrum of possibilities. At one extreme, the computer may act merely as a checker on a detailed formal proof produced by a human; at the other the prover may be highly automated and powerful, while nevertheless being subject to some degree of human guidance. In view of the practical limitations of pure automation, it seems today that, whether one likes it or not, interactive proof is likely to be the only way to formalize most non-trivial theorems in mathematics or computer system correctness. Almost all the earliest work on computer-assisted proof in the 1950s [Davis, 1957; Gilmore, 1960; Davis and Putnam, 1960; Wang, 1960; Prawitz et al., 1960] and 1960s [Robinson, 1965; Maslov, 1964; Loveland, 1968] was devoted to truly automated theorem proving, in the sense that the machine was supposed to prove assertions fully automatically. It is true that there was still a considerable diver- sity of methods, with some researchers pursuing AI-style approaches [Newell and Simon, 1956; Gelerntner, 1959; Bledsoe, 1984] rather than the dominant theme of automated proof search, and that the proof search programs were often highly tun- able by setting a complicated array of parameters. As described by Dick [2011], the designers of automated systems would often study the details of runs and tune the systems accordingly, leading to a continuous process of improvement and understanding that could in a very general sense be considered interactive.
    [Show full text]
  • The Record 2018/19
    The Record 2018/19 The Record 2018/19 contents 5 Letter from the Warden 6 Fellows and Academic Staff 9 Fellowship Elections and Appointments 10 Non-academic Staff 13 JCR and MCR Committees 14 Matriculation 20 Undergraduate Scholarships 22 College Awards and Prizes 24 Academic Distinctions 27 Higher Degrees 28 Fellows’ Publications 34 Sports and Games 39 Clubs and Societies 40 The Chapel 41 Parishes Update 41 Bursar’s Update 41 Gifts to the Library and Archive 42 Fellows’ Obituaries 44 Alumni Obituaries 59 News of Alumni letter from the warden This is being written a week after the official opening of The H B Allen Centre by HRH The Duke of Cambridge. For everyone present it was a magnificent College occasion as we marked the completion of our major new building. The Duke was introduced to major donors to the project, to members of the project team, to a group of our graduate students, to some of those working in the area of the very well-appointed basement occupied by Oxford Sciences Innovation (the fund which supports spin-outs from University research) and to some robots whose capabilities were demonstrated by Professor Paul Newman’s team in the Oxford Robotics Institute which is also located in part of the space under the new quad. The timing of the event was perfect in relation to the beginning of our programme of celebration for the College’s 150th anniversary. As usual, there have been changes in the Fellowship which I need to record. Two people departed at the end of Trinity Term.
    [Show full text]
  • Recollections of Early AI in Britain: 1942-1965 (Video for the BCS Computer Conservation Society's October 2002 Conference on the History of AI in Britain)
    Recollections of early AI in Britain: 1942-1965 (video for the BCS Computer Conservation Society's October 2002 Conference on the history of AI in Britain). My name is Donald Michie. Let me first introduce my friend Michael Bain, who has very kindly agreed to conduct this interview. Michael graduated in Psychology from Edinburgh and after gaining a Diploma in the Artificial Intelligence Department he joined the Turing Institute in 1987. During the fifteen years since then he and I have worked together on a number of scientific projects, to our considerable mutual enjoyment. What was your earliest contact with the idea of intelligent machinery? Arriving at Bletchley Park in 1942 I formed a friendship with Alan Turing, and in April 1943 with Jack Good. The three of us formed a sort of discussion club focused around Turing's astonishing "child machine" concept. His proposal was to use our knowledge of how the brain acquires its intelligence as a model for designing a teachable intelligent machine. What was his basic idea? Turing's belief about intelligence was that the PROPENSITY is INNATE, but the ACTUALITY has to be BUILT. For him the crux was the brain's ability to make sense of its inputs, that is to understand them. And how would we tell whether we had succeeded? To assess degrees of machine understanding he was later to propose what is celebrated today as the Turing Test. So how did he see AI's task? AI's first task was to build a propensity, which means a general learning program.
    [Show full text]
  • Tate 2007 Planning and Doing Thigns
    Edinburgh Research Explorer Planning and Doing Things Citation for published version: Tate, A 2007, 'Planning and Doing Things', AISB Quarterly, vol. 125, pp. 7-8. <http://www.aisb.org.uk/publications/aisbq/AISBQ125.pdf> Link: Link to publication record in Edinburgh Research Explorer Document Version: Publisher's PDF, also known as Version of record Published In: AISB Quarterly General rights Copyright for the publications made accessible via the Edinburgh Research Explorer is retained by the author(s) and / or other copyright owners and it is a condition of accessing these publications that users recognise and abide by the legal requirements associated with these rights. Take down policy The University of Edinburgh has made every reasonable effort to ensure that Edinburgh Research Explorer content complies with UK legislation. If you believe that the public display of this file breaches copyright please contact [email protected] providing details, and we will remove access to the work immediately and investigate your claim. Download date: 07. Oct. 2021 Quarterly No.125 The Newsletter of the Society for the Study of Artificial Intelligence and Simulation of Behaviour In this issue: Features Three-Dimensional • Daniel Myatt and Slavomir Nasuto 1 Three Dimensional Recon- Reconstruction of Neurons struction of neurons • Nicholas Jennings 3 with Neuromantic Decentralised Control of Complex Systems • Austin Tate 7 Despite the tendency of traditional artificial neural nected cylinders of varying radius and length. The Planning and Doing Things networks to simplify the role of dendritic and axonal tree is thus stored as a series of points, where each morphology to simple connections between neurons, point is associated with a 3D position and radius, as Society in reality neurites have an important role to play in well as having a corresponding ‘parent point’.
    [Show full text]
  • On Machine Intelligence, Second Edition
    MeyPVXe: MACHINE LEARNING: Applications in SeeCueMianitchi httrite) INTELLIGENCE DONALDMICHIE ULLaskalleoe veSete neeTEUe ultelat te) THE MIND AND THE MACHINE: Philosophical Aspects ofArtificial Intelligence LOGICS FOR ARTIFICIAL INTELLIGENCE | COMPUTERINTERPRETATION OF NATURAL LANGUAGEDESCRIPTIONS ESRRe) eeseeect) Opportunity Donald Michie was amongthepioneersof Bletchley Park from 1942-1945, working with the Colossus series of computers. After a post-war careerin biology, for which Oxford University awarded him the D.Sc., he formed the Experimental Programming Unit at Edinburgh in 1965, and conceived and directed the FREDDY robotproject, recognised as a world first. He held the chair of Machine Intelligence at Edinburgh from 1967-1985, and is Editor- in-Chief of the acclaimed MachineIntelligence series, as well as co-editing /nte/ligent Systems (Ellis Horwood, 1983). He is Chief Scientist and Director of Researchat the Turing Institute and is a Fellow of the Royal Society of Edinburgh and of the British Computer Society. Ellis HorwoodSeries in ARTIFICIAL INTELLIGENCE Series Editor: Professor John Campbell, Departmentof ComputerScience, University College London ON MACHINEINTELLIGENCE, Second Edition DONALD MICHIE,TheTuringInstitute, Glasgow This lucid commentary on twenty-five years with machines whichlearn and plantraces and illuminates the latest progress towards the so of the intelligent machine.It surveys an integrated sequenceof researches undertaken by Professor Michie and his colleagues, while at the same time providing an authoritative introduction to the subject. This second edition, which has been completely revised and expanded, incorporates much stimulating new material, resulting in a new book rather than a new edition. Half of the present text has been newly written, and fresh introductory notes supplied for each of the book's four main sections.
    [Show full text]