Computation and Intelligence: Collected ReadingsGeorge F. Luger Computation and Intelligence brings together 29 readings in Artificial Intelligence that are particularly relevant to today's student/practitioner. With its helpful critique of the selections, extensive bibliography, and clear presentation of the material, Computation and Intelligence will be a useful adjunct to any course in AI as well as a handy reference for professionals in the field. The book is divided into five parts, each reflecting the stages of development of AI. The first part, Foundations,, contains readings that present or discuss foundational ideas linking computation and intelligence, typified by A. M. Turing's "Computing Machinery and Intelligence." The second part, Knowledge Representation, presents a sampling of numerous representational schemes by Newell, Minsky, Collins & Quillian, Winograd, Schank, Hayes, Holland, McClelland, Rumelhart, Hinton, and Brooks. The third part, Weak Method Problem Solving, fouses on the research and design of syntax-based problem solvers, including the most famous of these, the Logic Theorist and GPS. The fourth part, Reasoning in Complex and Dynamic Environments, presents a broad spectrum of the AI community's research in knowledge-intensive problem solving, from McCarthy's early design of systems with "common sense" to model-based reasoning. The two concluding selections, by Marvin Minsky and by Herbert Simon, respectively, present the recent thoughts of two of AI's pioneers who revisit the concepts and controversies that have developed during the evolution of the tools and techniques that make up the current practice of Artificial Intelligence. |
From inside the book
Results 1-3 of 87
Collected Readings George F. Luger. make a problem well defined . No goal is defined . But if the comparator defined relation between trials is " transitive " ( i.e. , if A dominates B and B dominates C implies that A dominates C ) ...
... defined . Then , in the second step , an explicit sampling procedure emphasizing the sampling of combinations is ... defined in this way . Note that schemata for classifiers define sub- sets of the space of possible conditions ( or ...
... defined that are not also in the initial model . These lists represent the changes in the initial model needed to form the model being defined , and our assumption implies they will contain only a small number of clauses . To specify a ...
Contents
Part OneFoundations | 1 |
In Defense of Logic | 10 |
Consultation Systems for Physicians | 21 |
Copyright | |
30 other sections not shown