Checking a rule base with certainty factor for incompleteness and inconsistency
Checking a rule base for incompleteness and inconsistency should be based on possible execution paths of rules. For checking a rule base with certainty factor, we should consider not only simple execution paths, but also complex execution paths of rules. A goal can be resolved with a qualified hypothesis. This paper describes how to find all the possible execution paths, which can generate a qualified hypothesis for a goal, and how to check a rule base with certainty factor by using them.
KeywordsLeaf Node Rule Base Execution Path Certainty Factor Tion Path
Unable to display preview. Download preview PDF.
- Shorliffe, E. H., "Computer-based Medical Consultations: MYCIN", Elsevier/North-Holland, New York, 1976Google Scholar
- Nguyen, T. A., Perkins, W. A., Laffey, T. J., Pecora, D., "Checking an Expert Systems Knowledge Base For Consistency and Completeness", IJCAI, 1985Google Scholar
- Raatz, S., Drastal, G., "Rule Interaction in Expert System Knowledge Bases", CSCSI, 1986Google Scholar
- Lim, E. L., Tsang, W. W., McCallum, J., "Graph model for checking consistency and completeness of production rules", TRB8/86, Department of Computer Science, NUS, 1986Google Scholar
- Suwa, M., Scott, A. C. and Shorliffe, E. H., "An approach to verifying completeness and consistency in a rule-based expert system", AI Magazine, Vol 3, no 3, Fall 1982Google Scholar
- S. C. Kim, J. W. Yang, "the Specification of UNIX File Management Expert Prototype", TM87-1240-46, Computer Development Division, ETRI, 1987.Google Scholar