Premium
Strategies for building propositional expert systems
Author(s) -
Colomb Robert M.,
Chung Charles Y. C.
Publication year - 1995
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.4550100303
Subject(s) - computer science , propositional calculus , expert system , propositional formula , propositional variable , artificial intelligence , programming language , software engineering , description logic , intermediate logic
The core of this article is a proof that stratified Horn clause propositional systems are equivalent to and can be efficiently transformed into decision tables by a process closely related to assumption‐based truth maintenance. the transformed systems execute much faster and in a bounded time, leading to the possibility of executing real‐time expert systems in microseconds on fine‐grained parallel computers. One consequence is to simplify the consistency and completeness analysis for such systems, in particular the problem of ambiguity. A deeper consequence is that it makes sense to view these systems as stochastic processes. This, and an analysis of the problem of maintenance of these systems, leads to the conclusion that by and large rule induction approaches are better than rule construction approaches for building them. © 1995 John Wiley & Sons, Inc.