Question

Consider the KB A <=> B A => C D => E C AND E =>...

Consider the KB

A <=> B
A => C
D => E
C AND E => F
B
D

Show that this entails F by

i. Forward Chaining
ii. Backward Chaining
iii. Resolution

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Answer :

O By froward chaining i A B A BA LAB L, BA AC (3) O» E СЛЕ НЕ v B fact - B and o O here V pobored (1) Cockwand chaining conclby Resolution! ARB (A-1 B)^(B-MA) (NAVB)(NBVA) (NA VB)(NBUA) (simplification) NAVBY also (WAVB) (NEVA) (simplification) ! (TO pocove f by contradiction using resolution, NCUNEVF CVE NAVC NBVA NA NB NOVE false. so of is false then fis rue. hence psc

NOTE : PLEASE GIVE ME UP VOTE. THANK YOU.

Add a comment
Know the answer?
Add Answer to:
Consider the KB A <=> B A => C D => E C AND E =>...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Answer the following questions . [15 marks] Consider the following set of known facts and rules f...

    Answer the following questions . [15 marks] Consider the following set of known facts and rules for a production system. (Check the Forward and Backward Chaining slides in the Rule Based Systems file in Module 3 for an example). Facts (known to be true): A, B, C Rules 1. A D (means that if A is true then D is true) 3. B&D- E (means that if B and D are both true then E is true) 11. E& F-J...

  • Let A = { a, b, c, d, e, f} , B={c, d, e, f, g,...

    Let A = { a, b, c, d, e, f} , B={c, d, e, f, g, h} and C= {a, c, d, f, h, i, j} i. A N (BNC) ii. A UBUC iii.(AUB) O C iv.(AN BU C

  • 1. Consider the code sequence: C= A + B D= A-E F= C+ D Assume the...

    1. Consider the code sequence: C= A + B D= A-E F= C+ D Assume the values A, B, C, D, E, and F reside in memory. For each Architecture I. Accumulator Architecture II. Memory- Register Architecture III. Register-Register Architecture write the code assuming the instruction codes (opcode) are 8 bits, memory addresses are 32 bits, and register addresses are 6 bits and CPU has 64 Registers; and create a table which specifies: – The execution sequence – The variables...

  • 2) Consider the gel to the right. The DNA being digested is linear and 20 kb...

    2) Consider the gel to the right. The DNA being digested is linear and 20 kb in length. Lane "T" is a standard DNA ladder, not a digestion. (2 points total) I Gel lanes II III IV V Which of the following is TRUE? 20 K a) The enzyme used in lane III cuts 4 times b) The enzyme used in lane II cuts 1 time c) The enzyme used in lane IV cuts 3 times d) It is likely...

  • 5. Match an expression A, B, C, D or E to one of the following three...

    5. Match an expression A, B, C, D or E to one of the following three concepts. i. F k 9142 = p2 ii. 3 kx2 iii. F = -kx Expression iii. [Choose ] Planck equation Spring force law The Coulomb interaction Spring potential energy Electromagnetic wave equation Expression i. Expression ii. [Choose]

  • Consider the following sequence of page references: A,B,B,C,A,E,D,B,D,E,A,C,E,B,A,C,A,F,D,F and consider that a working set strategy is...

    Consider the following sequence of page references: A,B,B,C,A,E,D,B,D,E,A,C,E,B,A,C,A,F,D,F and consider that a working set strategy is used for page replacement. What will the contents of the working set at each stage be for the following? a. Window Size = 2 b. Window Size = 3 c. Window Size = 4

  • Shortest paths Consider a directed graph with vertices fa, b, c, d, e, f and adjacency...

    Shortest paths Consider a directed graph with vertices fa, b, c, d, e, f and adjacency list representation belovw (with edge weights in parentheses): a: b(4), f(2) e: a(6), b(3), d(7) d: a(6), e(2) e: d(5) f: d(2), e(3) (i) Find three shortest paths from c to e. (ii) Which of these paths could have been found by Dijkstra's shortest path algorithm? (Give a convincing explanation by referring to the main steps of the algorithm.)

  • Problem #3: Let A, B, C, and D be matrices with the following sizes: A, 7x5...

    Problem #3: Let A, B, C, and D be matrices with the following sizes: A, 7x5 B, 5x4 C, 5x7 D, 1X5 Which of the following matrix operations are defined? (1) AB (ii) A+{c (iii) DC (A) (i) and (iii) only (B) all of them (C) (ii) only (D) none of them (E) (iii) only (F) (i) only (G) (i) and (ii) only (H) (ii) and (iii) only

  • numerical analysis 1 f (x + 2h) f"(x) = 2f (x + h) + f (x)...

    numerical analysis 1 f (x + 2h) f"(x) = 2f (x + h) + f (x) 12 Forward difference II f(x - 2h) f"() = 25(x - hr) 12 method Backward method difference f'(x) = -f(+ 2) + 4(x +h)- 36) 2h Forward difference method Which ones are correct? a) I, II b) Only 11 a d) Only 1 e> I, II, III

  • Predict the product for the fallowing reaction. A) I B) II C) III D) IV E)...

    Predict the product for the fallowing reaction. A) I B) II C) III D) IV E) none of these Predict the major product for the following reaction. A) I D) II C) III D) IV E) none of these

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT