
Accession Number : ADA185626
Title : Automating Rule Strengths in Expert Systems.
Descriptive Note : Doctoral thesis 1 Jul 8331 Aug 86,
Corporate Author : DUKE UNIV DURHAM NC DEPT OF COMPUTER SCIENCE
Personal Author(s) : Valtorta, Marco G
PDF Url : ADA185626
Report Date : May 1987
Pagination or Media Count : 157
Abstract : Automating rule strengths in expert systems is a way to alleviate the knowledge acquisition bottleneck. It is assumed that rules are fixed, except for the values of their strengths, which are computed or adjusted from initial values given by experts. A model of expert systems is proposed, in which rules have the form IF (P sub 1 & P sub 2 & . . . & P sub n) THEN C WITH ATTENUATION a, where P sub 1, P sub 2 , . . ., P sub n, and C are weighted propositions, i.e., statements with a certainty factor (CF), and a, the strength of the rule, is a number between 0 and 1. To compute rule attenuations, two problem settings are considered. In the first, an oracle is given, that can provide the CFs of the conclusions of the entire rulebased system, given any assignment of certainty factors to the premises of the entire system (complete case). In the second, a fixed set of cases is available (incomplete case). A fast algorithm for synthesis in the complete case for simple rule bases is given both for MAX and probabilistic sum. In the incomplete case, the synthesis of attenuations is shown to be NPComplete, even for very shallow rule bases with only two propositions in the premise of each rule, both for MAX and probabilistic sum. The refinement of attenuations from expertgiven estimates is shown to be NPHard, no matter how close to the correct value the estimates are and how small an improvement towards the correct value is desired. (Author)
Descriptors : ACQUISITION, ALGORITHMS, ATTENUATION, MODELS, SHALLOW DEPTH, SYNTHESIS
Subject Categories : Cybernetics
Distribution Statement : APPROVED FOR PUBLIC RELEASE