Suppose a knowledge base contains just the following first-order Horn clauses: Ancestor(Mother(x), x) Ancestor(x, y) ∧ Ancestor(y, z) ⇒ Ancestor(x, z) Consider a forward chaining algorithm that, on...

Suppose a knowledge base contains just the following first-order Horn clauses:
Ancestor(Mother(x), x)
Ancestor(x, y) ∧ Ancestor(y, z) ⇒ Ancestor(x, z)
Consider a forward chaining algorithm that, on the jth iteration, terminates if the KB contains a sentence that unifies with the query, else adds to the KB every atomic sentence that can be inferred from the sentences already in the KB after iteration j − 1. Can a resolution algorithm prove the sentence ¬Ancestor(John,John) from the original
knowledge base? Explain how, or why not.

Jun 10, 2022

SOLUTION.PDF

Suppose a knowledge base contains just the following first-order Horn clauses: Ancestor(Mother(x), x) Ancestor(x, y) ∧ Ancestor(y, z) ⇒ Ancestor(x, z) Consider a forward chaining algorithm that, on...

Get Answer To This Question

Related Questions & Answers

Submit New Assignment