In a database, a rule is defined as (P1 and P2) or P3? R1 (0.8) and R2 (0.3), where P1, P2, P3 are premises and R1. R2 are conclusions of rules with certainty factors (CF) 0.8 and 0.3 respectively. If any running program has produced P1, P2, P3 with CF as 0.5, 0.8. 0.2 respectively, find the CF of results on the basis of premises.
CF (R1 = 0.15), CF (R2 = 0.35)
Certainty Factors (CF) are numerical values used in some rule-based expert systems to represent the degree of belief or disbelief in a conclusion. They typically range from -1 (complete disbelief) to +1 (complete belief), with 0 indicating no information or neutral belief. In this question, we are dealing with positive CFs representing degrees of belief.
We are given a rule in a database that connects premises to conclusions with associated certainty factors:
We are also provided with the certainty factors that a running program has produced for each premise:
Our goal is to find the certainty factors of the conclusions R1 and R2 based on these premise CFs and the structure of the rule.
In systems using Certainty Factors, the certainty of compound premises is calculated using specific rules for logical operators:
Let's calculate the certainty of the premise (P1 and P2) or P3 step-by-step:
So, the combined certainty factor for the entire premise (P1 and P2) or P3 is 0.5.
The certainty of the combined premise is then used to determine the certainty of the conclusions R1 and R2. If a rule states IF Premise THEN Conclusion WITH CF_rule, the resulting certainty for the conclusion is usually calculated as \( \text{CF}(\text{Conclusion}) = \text{CF}(\text{Premise}) \times \text{CF\_rule} \), provided the premise has positive certainty.
In this case, the combined premise certainty is 0.5. Applying this to the conclusions:
Thus, the certainty factors for the results are CF(R1) = 0.15 and CF(R2) = 0.35.
Comparing these results with the given options, we find that Option 3 matches our calculated certainty factors.
| Concept | Explanation | Typical Calculation |
|---|---|---|
| Certainty Factor (CF) | A numerical value indicating degree of belief in a statement. Ranges typically -1 to +1. | Given input or calculated. |
| CF of (A AND B) | Belief in both A and B being true. | \( \min(\text{CF}(A), \text{CF}(B)) \) |
| CF of (A OR B) | Belief in A or B (or both) being true. | \( \max(\text{CF}(A), \text{CF}(B)) \) |
| CF of Conclusion from Premise | Belief in a conclusion given the belief in its premise via a rule. | \( \text{CF}(\text{Premise}) \times \text{CF\_rule} \) (for positive premise CF) |
This problem is an example from the field of expert systems, a branch of artificial intelligence. Expert systems are designed to mimic the decision-making ability of a human expert.
Understanding how certainty factors are combined and propagated is crucial in building and analyzing such rule-based expert systems for tasks like diagnosis, prediction, and decision support.
Let R (ABCDEFGH) be a relation schema and F be the set of dependencies F = {A → B, ABCD → E, EF → G, EF → H and ACDF →EG}. The minimal cover of a set of functional dependencies is
Minimal cover F’ of functional dependency set F is
Assume that given table R is decomposed in two tables
R 1(A, B, C) with functional dependency set f 1= {A → B, A → C} and R 2(A, D, E) with FD set F 2= {A → D, D → E}
Which of the following option is true w.r.t. given decomposition?Identify the redundant functional dependency in F
Identify primary key of table R with functional dependency set F