作者: N.L. Griffin , F.D. Lewis
关键词: Correctness 、 Graph (abstract data type) 、 Finite-state machine 、 Tree (graph theory) 、 Computer science 、 Inference engine 、 Theoretical computer science 、 Knowledge representation and reasoning 、 Legal expert system 、 Artificial intelligence 、 Expert system
摘要: An inference engine for rule-based expert systems which forms part of the EXPRES system is developed and presented. It shown to be universal, correct, optimal with respect time. Its correctness due following facts: invoked when attributes change, conditions are checked their take values, rules examined whenever actions executed fired. Optimality execution time primarily fact that nothing done does not need doing. In particular, happens until change value, evaluated only if defined, true. Another reason efficiency it a finite-state machine operates on graph rather than tree. A VLSI implementation allows automatic design universal as well special-purpose chip proposed. >