Very fast decision table execution of propositional expert systems

Authors:
Robert M. Colomb;Charles Y. C. Chung
Affiliations:
CSIRO Division of Information Technology, North Ryde, NSW, Australia;CSIRO Division of Information Technology, North Ryde, NSW, Australia
Venue:
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Year:
1990

Citing 4
Cited 0

Parallel algorithms and architectures for rule-based systems

ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
A decision-table-used processor for checking completeness and consistency in rule-based expert systems

International Journal of Man-Machine Studies
Induction of Decision Trees

Machine Learning
Checking an expert systems knowledge base for consistency and completeness

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

A formal equivalence between propositional expert systems and decision tables is proved, and a practicable procedure given to perform the transformation between propositional expert systems and decision tables. The method gave an order of magnitude speed increase for a well-known expert system in routine use. The method is very general: adaptations are shown for forward and backward chaining inferencing engines, inexact reasoning, and systems where some facts have a high cost and must be determined only if necessary. A particular application for the decision table representation is in real-time expert systems, since a simple hardware implementation is available which gives further orders of magnitude increase in performance. Finally, the decision table representation greatly simplifies the problem of completeness and consistency checking.