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 17
... theorem proving approach ( and sometimes of a theorem proving approach altogether ) the primary difficulties are related to the efficiency of current techniques , even in those areas where the first order logic seems quite appropriate ...
... Theorem Proving: An Introduction to the Hipster System Moa Johansson( B ) Department of Computer Science and Engineering, Chalmers University of Technology, Gothenburg, Sweden moa.johansson@chalmers.se ... Theorem Proving: 1 Introduction.
... Proving System . In cade , 1986 . 18. K. Bläsius , N. Eisinger , J. Siekmann ... Theorem Prov- ing . AIJ , 2 : 57-78 , 1971 . 20. R. N. Bol , K. R. Apt , and ... theorem prover for a computational logic . In Mark E. Stickel , editor ...
... theorem has been employed to formally verify the strict real convex property of a given function in Chap. 4. Moreover, the proposed formalizations for stability, microeconomics models and asymptotic ... Theorem Proving 2.4 Summary References.
... theorem whose statement has the form p ⇒ l = r, conditional rewriting replaces, in a term t, any subterm matching l, if the condition p can be proven automatically for the corresponding instantiation. (Conditional) rewriting may not prove ...
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 |