Building Expert Systems in Prolog: Springer Compass International
Autor Dennis Merritten Limba Engleză Paperback – 24 oct 2011
Preț: 649.60 lei
Preț vechi: 812.01 lei
-20% Nou
Puncte Express: 974
Preț estimativ în valută:
124.34€ • 135.11$ • 104.51£
124.34€ • 135.11$ • 104.51£
Carte tipărită la comandă
Livrare economică 21 aprilie-05 mai
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781461389132
ISBN-10: 1461389135
Pagini: 380
Ilustrații: XV, 358 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.53 kg
Ediția:Softcover reprint of the original 1st ed. 1989
Editura: Springer
Colecția Springer
Seria Springer Compass International
Locul publicării:New York, NY, United States
ISBN-10: 1461389135
Pagini: 380
Ilustrații: XV, 358 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.53 kg
Ediția:Softcover reprint of the original 1st ed. 1989
Editura: Springer
Colecția Springer
Seria Springer Compass International
Locul publicării:New York, NY, United States
Public țintă
Professional/practitionerCuprins
1 Introduction.- 1.1 Expert Systems.- 1.2 Expert System Features.- 1.3 Sample Applications.- 1.4 Prolog.- 1.5 Assumptions.- 2 Using Prolog’s Inference Engine.- 2.1 The Bird Identification System.- 2.2 User Interface.- 2.3 A Simple Shell.- 2.4 Summary.- 3 Backward Chaining with Uncertainty.- 3.1 Certainty Factors.- 3.2 MYCIN’S Certainty Factors.- 3.3 Rule Format.- 3.4 The Inference Engine.- 3.5 Making the Shell.- 3.6 English-like Rules.- 4 Explanation.- Value of Explanations to the User.- Value of Explanations to the Developer.- Types of Explanation.- 4.1 Explanation in Clam.- 4.2 Native Prolog Systems.- 5 Forward Chaining.- 5.1 Production Systems.- 5.2 Using Oops.- 5.3 Implementation.- 5.4 Explanations for Oops.- 5.5 Enhancements.- 5.6 Rule Selection.- 5.7 LEX.- 5.8 MEA.- 6 Frames.- 6.1 The Code.- 6.2 Data Structure.- 6.3 The Manipulation Predicates.- 6.4 Using Frames.- 6.5 Summary.- 7 Integration.- 7.1 Foops (Frames and Oops).- 7.2 Room Configuration.- 7.3 A Sample Run.- 7.4 Summary.- 8 Performance.- 8.1 Backward Chaining Indexes.- 8.2 Rete Match Algorithm.- 8.3 The Rete Graph Data Structures.- 8.4 Propagating Tokens.- 8.5 The Rule Compiler.- 8.6 Integration with Foops.- 8.7 Design Tradeoffs.- 9 User Interface.- 9.1 Object Oriented Window Interface.- 9.2 Developer’s Interface to Windows.- 9.3 High-Level Window Implementation.- 9.4 Low-Level Window Implementation.- 10 Two Hybrids.- 10.1 CVGEN.- 10.2 The Knowledge Base.- 10.3 Inference Engine.- 10.4 Explanations.- 10.5 Environment.- 10.6 AIJMP.- 10.7 Summary.- 11 Prototyping.- 11.1 The Problem.- 11.2 The Sales Advisor Knowledge Base.- 11.3 The Inference Engine.- 11.4 User Interface.- 11.5 Summary.- 12 Rubik’s Cube.- 12.1 The Problem.- 12.2 The Cube.- 12.3 Rotation.- 12.4 High Level Rules.- 12.5 Improving theState.- 12.6 The Search.- 12.7 More Heuristics.- 12.8 User Interface.- 12.9 On the Limits of Machines.- Appendix A Native.- Sample Dialog.- Birds Knowledge Base.- Native Shell.- Appendix B Clam.- Sample Dialog.- Car Knowledge Base.- Clam.- Ldruls.- Appendix C Oops.- Sample Dialog.- Room Knowledge Base.- Oops.- Appendix D Foops.- Sample Dialog.- Room Knowledge Base (Foops).- Foops.- Appendix E Rete-Foops.- Rete Compiler and Runtime.- Appendix F Windows.- Window Demonstration.- Windows (abbreviated).- Appendix G Rubik.- Rubik.- Rubdata.- References.- Predicate Index.