
最 低 价:¥34.00
| Joseph C.Giarratano 美国休斯顿大学明湖分校计算机科学系教授。作为NASA的顾问,他参与了专家系统工具CLIPS(包含在本书中)的开发。另外,他发表了超过30篇研究论文并著有超过10本书。 Gary D. Riley 于1984年在美国得克萨斯A&M大学获计算机科学硕士学位。他在NASA工作了11年,并为CLIPS专家系统语言开发了基于规则的特性部分。目前他居住在得克萨斯州,任职于PeopleSoft有限公司。 .. << 查看详细 |
| preface vii chapter 1: introduction to expert systems 1 1.1 introduction 1 1.2 what is an expert system 1 1.3 advantages of expert systems 8 1.4 general concepts of expert systems 9 1.5 characteristics of an expert system 12 1.6 the development of expert systems technology 14 1.7 expert systems applications and domains 20 1.8 languages, shells, and tools 26 1.9 elements of an expert system 28 1.10 production systems 34 1.11 procedural paradigms 38 1.12 nonprocedural paradigms 45 1.13 artificial neural systems 51 1.14 connectionist expert systems and inductive learning 58 1.15 the state of the art in artificial intelligence 58 1.16 summary 63 problems 63 .bibliography 64 chapter 2: the representation of knowledge 67 2.1 introduction 67 2.2 the meaning of knowledge 69 2.3 productions 74 2.4 semantic nets 78 2.5 object-attribute-value triples 82 2.6 prolog and semantic nets 83 2.7 difficulties with semantic nets 88 2.8 schemata 90 2.9 frames 91 2.10 difficulties with frames 95 2.11 logic and sets 96 2.12 propositional logic 99 2.13 the first order predicate logic 105 2.14 the universal quantifier 106 2.15 the existential quantifier 108 2.16 quantifiers and sets 109 2.17 limitations of predicate logic 110 2.18 summary 111 problems 111 bibliography 114 chapter 3: methods of inference 115 3.1 introduction 115 3.2 trees, lattices, and graphs 116 3.3 state and problem spaces 120 3.4 and-or trees and goals 125 3.5 deductive logic and syllogisms 129 3.6 rules of inference 136 3.7 limitations of propositional logic 144 3.8 first-order predicate logic 146 3.9 logic systems 148 3.10 resolution 152 3.11 resolution systems and deduction 154 3.12 shallow and causal reasoning 157 3.13 resolution and first-order predicate logic 161 3.14 forward and backward chaining 167 3.15 other methods of inference 173 3.16 metaknowledge 182 3.17 hidden markov models 183 3.18 summary 184 problems 185 bibliography 188 chapter 4: reasoning under uncertainty 189 4.1 introduction 189 4.2 uncertainty 190 4.3 types of error 192 4.4 errors and induction 194 4.s classical probability 197 4.6 experimental and subjective probabilities 202 4.7 compound probabilities 204 4.8 conditional probabilities 207 4.9 hypothetical reasoning and backward induction 212 4.10 temporal reasoning and markov chains 217 4.11 the odds of belief 222 4.12 sufficiency and necessity 224 4.13 uncertainty in inference chains 227 4.14 the combination of evidence 232 4.15 inference nets 240 4.16 the propagation of probabilities 250 4.17 summary 255 problems 256 bibliography 260 chapter 5: inexact reasoning 261 5.1 introduction 261 5.2 uncertainty and rules 262 5.3 certainty factors 268 5.4 dempster-shafer theory 279 5.5 approximate reasoning 294 5.6 the state of uncertainty 342 5.7 some commercial applications of fuzzy logic 344 5.8 summary 346 problems 346 bibliography 350 chapter 6: design of expert systems 353 6.1 introduction 353 6.2 selecting the appropriate problem 354 6.3 stages in the development of an expert system 358 6.4 errors in development stages 362 6.5 software engineering and expert systems 367 6.6 the expert system life cycle 370 6.7 a detailed life cycle model 373 6.8 summary 379 problems 380 bibliography 380 chapter 7: introduction to clips 383 7.1 introduction 383 7.2 clips 384 7.3 notation 385 7.4 fields 387 7.5 entering and exiting clips 390 7.6 facts 392 7.7 adding and removing facts 395 7.8 modifying and duplicating facts 398 7.9 the watch command 399 7.10 the deffacts construct 400 7.11 the components of a rule 401 7.12 the agenda and execution 404 7.13 commands for manipulating constructs 408 7.14 the printout command 411 7.15 using multiple rules 411 7.16 the set-break command 413 7.17 loading and saving constructs 415 7.18 commenting constructs 417 7.19 variables 417 7.20 multiple use of variables 419 7.21 fact addresses 420 7.22 single-field wildcards 422 7.23 blocks world 424 7.24 multifield wildcards and variables 430 7.25 summary 435 problems 436 bibliography 441 chapter 8' advanced pattern matching 443 8.1 introduction 443 8.2 field constraints 443 8.3 functions and expressions 447 8.4 summing values using rules 451 8.5 the bind function 453 8.6 i/o functions 454 8.7 the game of sticks 461 8.8 predicate functions 463 8.9 the test conditional element 464 8.10 the predicate field constraint 466 8.11 the return value field constraint 467 8.12 the sticks program 469 8.13 the or conditional element 469 8.14 the and conditional element 472 8.15 the not conditional element 473 8.16 the exists conditional element 476 8.17 the forall conditional element 479 8.18 the logical conditional element 481 8.19 summary 485 problems 486 chapter 9: modular design, execution control, and rule efficiency 495 9.1 introduction 495 9.2 deftemplate attributes 495 9.3 salience 504 9.4 phases and control facts 507 9.5 misuse of salience 512 9.6 the defmodule construct 514 9.7 importing and exporting facts 518 9.8 modules and execution control 522 9.9 the rete patteru-matching algorithm 530 9.10 the pattern network 533 9.11 the join network 536 9.12 the importance of pattern order 539 9.13 ordering patterns for efficiency 545 9.14 multifield variables and efficiency 546 9.15 the test ce and efficiency 547 9.16 built-in pattern-matching constraints 549 9.17 general rules versus specific rules 549 9.18 simple rules versus complex rules 551 9.19 summary 554 problems 555 bibliography 562 chapter 10: procedural programming 563 10.1 introduction 563 10.2 procedural functions 563 10.3 the deffunction construct 571 10.4 the defglobal construct 582 10.5 the defgeneric and defmethod constructs 590 10.6 procedural constructs and defmodules 608 10.7 useful commands and functions 610 10.8 summary 617 problems 618 chapter 11: classes, instances, and message-handlers 623 11.1 introduction 623 11.2 the defclass construct 623 11.3 creating instances 625 11.4 system-defined message-handlers 626 11.5 the definstances construct 628 11.6 classes and inheritance 629 11.7 object pattern matching 638 11.8 user-defined message-handlers 650 11.9 slot access and handler creation 656 11.10 before, after, and around messsage-handlers 659 11.11 instance creation, initialization, handlers and deletion message-handlers 677 11.12 modifying and duplicating instances 680 11.13 classes and generic functions 684 11.14 instance set query functions 685 11.15 multiple inheritance 690 11.16 defclasses and defmodules 697 11.17 loading and saving instances 699 11.18 summary 700 problems 702 chapter 12: expert system design examples 705 12.1 introduction 705 12.2 certainty factors 705 12.3 decision trees 710 12.4 backward chaining 724 12.5 a monitoring problem 736 12.6 summary 755 problems 756 bibliography 757 appendixes 759 appendix a some useful equivalences 759 appendix b some elementary quantifiers and their meanings 760 appendix c some set properties 761 appendix d clips support information 762 appendix e clips commands and functions summary 763 appendix f clips bnf 785 appendix g software resources 793 index 827 |
商品评论(0条)