Principles of Artificial IntelligenceA classic introduction to artificial intelligence intended to bridge the gap between theory and practice, Principles of Artificial Intelligence describes fundamental AI ideas that underlie applications such as natural language processing, automatic programming, robotics, machine vision, automatic theorem proving, and intelligent data retrieval. Rather than focusing on the subject matter of the applications, the book is organized around general computational concepts involving the kinds of data structures used, the types of operations performed on the data structures, and the properties of the control strategies used. Principles of Artificial Intelligenceevolved from the author's courses and seminars at Stanford University and University of Massachusetts, Amherst, and is suitable for text use in a senior or graduate AI course, or for individual study. |
From inside the book
Results 1-5 of 48
... of electronic circuits; and Genesereth (1978, 1979), for helping casual users of the MACSYMA mathematical formula manipulation system [Martin and Fateman (1971)]. 0.3.4. THEOREM PROVING Early applications of AI ideas to proving 12 PROLOGUE.
... formula of the compound. A full explanation of how these candidate structures are generated is beyond the scope of our present discussion, but we can give a brief description of how the process works for a simple hydrocarbon. The system ...
... formulas satisfies the termination condition. Briefly, we can illustrate how the structure-proposing rules work by a simple example. Let us suppose that we are given the chemical formula C; H12. Our production system proposes some ...
Nils J. Nilsson. In the partial structures above, the formulas within vertical bars ( ) are unstructured. These can be ... formula –C2H5|: | || "-i-gH H A partial AND/OR tree for our C. His problem is shown in Figure 1.11. Each solution ...
You have reached your viewing limit for this book.
Contents
| 1 | |
| 17 | |
| 53 | |
CHAPTER 3 SEARCH STRATEGIES FOR DECOMPOSABLE PRODUCTION SYSTEMS | 99 |
CHAPTER 4 THE PREDICATE CALCULUS IN AI | 131 |
CHAPTER 5 RESOLUTION REFUTATION SYSTEMS | 161 |
CHAPTER 6 RULEBASED DEDUCTION SYSTEMS | 193 |
CHAPTER 7 BASIC PLANGENERATING SYSTEMS | 275 |
CHAPTER 8 ADVANCED PLANGENERATING SYSTEMS | 321 |
CHAPTER 9 STRUCTURED OBJECT REPRESENTATIONS | 361 |
PROSPECTUS | 417 |
BIBLIOGRAPHY | 429 |
AUTHOR INDEX | 467 |
SUBJECT INDEX | 471 |