A GRAPH-THEORETIC APPROACH TO EXPERT-SYSTEM TESTING

Logic paths play an important role during the testing of an expert system, as the number of test cases to be used is determined by these paths, and they are used for testing the system under consideration during implementation. This paper proposes an algorithm based on a graph-theoretic clustering concept to determine the logic paths in an expert system. It also allows the testing of the expert system during the validation and verification phases for defining the optimal number of test cases. The proposed algorithm is efficient and compact, and guarantees the consistency of the underlying system during its implementation phase.