BioinformaticsTutorialQuestions1–15thJanuary2003.docVIP

Artificial Intelligence Tutorial 3 - Answers 1a) Translate the following sentences into first order logic. All dogs are mammals Fido is a dog Fido is a mammal All mammals produce milk 1b) Use the Modus Ponens deduction rule to deduce sentence (iii) from (i) and (ii). What did you unify in order to use Modus Ponens, and what substitution made the unification possible? 1c) Write the answers from part (a) in conjunctive normal form. 1d) Translate the following sentence into CNF: “There exists a dog which doesn’t produce milk.” [You will have to use skolemisation for this – see the lecture notes. Also Russell Norvig give a good explanation.] 1e) Explain, in English, why this new sentence contradict sentences (i) to (iv) from part (a). 1a) The translation into first order logic is fairly straightforward: ? X (dog(X) → mammal(X)). dog(fido). mammal(fido). ? X (mammal(X) → milk(X)). 1b) To use Modus Ponens, we need a sentence that A implies B, and a sentence stating that A is true. We will then deduce B from it. Our “A implies B” sentence will be (i) above and our “A is true sentence” will be (ii) above. However, the left hand side of (i) is: dog(X), whereas (ii) is: dog(fido), so, as it stands, we cannot use Modus Ponens. So, we must unify dog(X) and dog(fido). This is done by substituting the constant fido for X. We can now apply this substitution as part of the deduction step. To show that the deduction has occurred, we write it as follows: ? X (dog(X) → mammal(X)) , dog(fido). mammal(fido) Because mammal(fido) appears below the line, we have deduced this sentence using our substitution and the Modus Ponens rule. 1c) Remember that CNF sentences are disjunctions of literals, where a literal can be a predicate or negated predicate. We also need to remember the rewrite rules the lecture notes prescribed for turning a normal first order sentence into a CNF sentence. For these particular sentences, we need to remember the rewrite rule