Consider the following logic puzzle by Lewis Carroll: Animals, that do not kick, are always unexcitable....

  

Transcribed Image Text:

Consider the following logic puzzle by Lewis Carroll: Animals, that do not kick, are always unexcitable. Donkeys have no horns. A buffalo can always toss one over a gate. No animals that kick are easy to swallow. No hornless animal can toss one over a gate. All animals are excitable, except buffaloes. (a) Translate the given KB into first-order definite clauses. Use predicates DONKEY (2), HORNLESS (2), CANTTOSS(2), NOTBUFFALO (2), EXCITABLE (2), KICKS(2), HARDTOSWOLLOW(x). (b) Use the forward-chaining inference algorithm to prove that the Donkey from Shrek (Donkey shrek) is not easy to swallow. Indicate which conclusions were added to the KB at each iteration (don't forget to show that all necessary premises were satisfied in each case of addition). (c) Draw the proof tree that is generated by the procedure in (b). (d) Use FOL resolution algorithm to prove that that Donkey shrek is not easy to swallow. Consider the following logic puzzle by Lewis Carroll: Animals, that do not kick, are always unexcitable. Donkeys have no horns. A buffalo can always toss one over a gate. No animals that kick are easy to swallow. No hornless animal can toss one over a gate. All animals are excitable, except buffaloes. (a) Translate the given KB into first-order definite clauses. Use predicates DONKEY (2), HORNLESS (2), CANTTOSS(2), NOTBUFFALO (2), EXCITABLE (2), KICKS(2), HARDTOSWOLLOW(x). (b) Use the forward-chaining inference algorithm to prove that the Donkey from Shrek (Donkey shrek) is not easy to swallow. Indicate which conclusions were added to the KB at each iteration (don't forget to show that all necessary premises were satisfied in each case of addition). (c) Draw the proof tree that is generated by the procedure in (b). (d) Use FOL resolution algorithm to prove that that Donkey shrek is not easy to swallow.