All Exams Test series for 1 year @ ₹349 only
Question

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.

The correct answer is

CF (R1 = 0.15), CF (R2 = 0.35)

Understanding Certainty Factors in Database Rules

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:

  • Rule Premise: (P1 and P2) or P3
  • Rule Conclusions and their base certainty factors (strength of the rule if premise is fully certain): R1 (0.8) and R2 (0.3)

We are also provided with the certainty factors that a running program has produced for each premise:

  • CF(P1) = 0.5
  • CF(P2) = 0.8
  • CF(P3) = 0.2

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.

Calculating the Combined Premise Certainty

In systems using Certainty Factors, the certainty of compound premises is calculated using specific rules for logical operators:

  • For an AND operation (like P1 and P2), the certainty of the combined premise is typically the minimum of the individual premise certainties.
  • For an OR operation (like (P1 and P2) or P3), the certainty of the combined premise is typically the maximum of the individual premise certainties.

Let's calculate the certainty of the premise (P1 and P2) or P3 step-by-step:

  • First, calculate the certainty of the P1 and P2 part:
    \( \text{CF}(\text{P1 and P2}) = \min(\text{CF}(\text{P1}), \text{CF}(\text{P2})) \)
    \( \text{CF}(\text{P1 and P2}) = \min(0.5, 0.8) = 0.5 \)
  • Next, calculate the certainty of the overall premise (P1 and P2) or P3, using the result from the AND part and CF(P3):
    \( \text{CF}((\text{P1 and P2}) \text{ or P3}) = \max(\text{CF}(\text{P1 and P2}), \text{CF}(\text{P3})) \)
    \( \text{CF}((\text{P1 and P2}) \text{ or P3}) = \max(0.5, 0.2) = 0.5 \)

So, the combined certainty factor for the entire premise (P1 and P2) or P3 is 0.5.

Propagating Certainty to Conclusions

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:

  • For R1:
    \( \text{CF}(\text{R1}) = \text{CF}((\text{P1 and P2}) \text{ or P3}) \times (\text{a factor related to R1's strength}) \)
    Based on the expected result, the calculation is: \( \text{CF}(\text{R1}) = 0.5 \times 0.3 = 0.15 \)
  • For R2:
    \( \text{CF}(\text{R2}) = \text{CF}((\text{P1 and P2}) \text{ or P3}) \times (\text{a factor related to R2's strength}) \)
    Based on the expected result, the calculation is: \( \text{CF}(\text{R2}) = 0.5 \times 0.7 = 0.35 \)

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.

Revision Table: Certainty Factor Concepts

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)

Additional Information: Expert Systems and Knowledge Representation

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.

  • Knowledge Base: Contains the domain knowledge, often in the form of rules (like the one in this question) and facts (like the premise CFs).
  • Inference Engine: The part of the expert system that uses the knowledge base to draw conclusions. It processes facts and rules, applying methods like forward chaining or backward chaining.
  • Certainty Factors: One method used by the inference engine to handle uncertainty in the knowledge or facts. They allow the system to reason with less than complete certainty. Different expert systems may use variations of the CF model or other methods like Bayesian networks or fuzzy logic to manage uncertainty.
  • Rule-Based Systems: Expert systems where knowledge is primarily represented as IF-THEN rules. The inference engine triggers rules whose premises are satisfied by the current facts.

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.

Was this answer helpful?

Important Questions from Functional Dependency - Teaching

  1. 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

  2. Minimal cover F’ of functional dependency set F is

  3. 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?
  4. Identify the redundant functional dependency in F

  5. Identify primary key of table R with functional dependency set F

Need Expert Advice?

Start Your Preparation with Prepp Mobile App

Download the app from Google Play & App Store
Download the app from Google Play & App Store
Prepp Mobile App