Artificial Intelligence Question

CS 4660: Artificial Intelligence

Fall 2022

Assignment 2

Due 11:59pm October 4th, 2022

Directions: Complete questions 1-5 below. Show your work where applicable. Submit 1 PDF document with your text answers (Typed or Handwritten and Scanned).

(10pt) Consider the following sentences.
1. ((smoke ∧ heat) → fire) ⇔ ((smoke → fire) ∨ (heat → fire))
  1. (2.5 pt) Show the truth table for this sentence
  2. (2.5 pt) Is this sentence Valid, Satisfiable, or Neither
2. (a₁ ∨ a₃) ∧ (¬a₁ ∨ a₂) ∧ (¬a₁ ∨ a₄) ∧ (¬a₁ ∨ ¬a₄) ∧ (¬a₃).
  1. (2.5 pt) Show the truth table for this sentence
  2. (2.5 pt) Is this sentence Valid, Satisfiable, or Neither

(20 pt) Represent the following sentences in first-order logic, using a consistent vocabulary (which you must define as well).
1. (1pt) Define the vocabulary. For example, you might have:
  1. Buys(X,Y,Z) = Person X buys Item Y from Person Z
  2. W > Score(X,Y,Z) = W is larger than score Person X gets in course Y during semester Z

Predicates: Person(X), Clever(Y), Politician(Z)

It may make more sense to do question a. last.

(1pt) Every person who buys a policy is clever.
(1pt) No person buys an expensive policy.
(1pt) There is a barber who shaves all men in town who do not shave themselves.
(1pt) A person born in the UK, each of whose parents is a UK citizen or a UK resident, is a UK citizen by birth.
(1pt) A person born outside the UK, one of whose parents is a UK citizen by birth, is a UK citizen by descent.
(1pt) Politicians can fool some of the people all of the time, and they can fool all of the people some of the time, but they can’t fool all of the people all of the time.
(1pt) Some students took Russian in spring 2001.
(1pt) Only one student took German in spring 2001.
(1pt) The best score in German is always higher than the best score in Russian.

(10 pt) Attempt to unify the following pairs of expressions. Either show their most general unifiers, or explain why they will not unify. Use the {a/b} substitution form. Upper case letters are variables, lowercase are constants. Assume all variables are universally instantiated.
1. (2 pt) p(X, a, Y) and p(Z, Z, b)
2. (2 pt) p(X, X) and p(a, b)
3. (2 pt) p(X, Y, Z) and p(c,d,d)
4. (2 pt) ancestor(X, father(X)) and ancestor(david, george)
5. (2 pt) p(a, X) and p(Y, Z)

(30 pt) Consider the following knowledge base
1. Prove that Q is true with:
2. P → Q
3. L ∧ M → P
4. B ∧ L → M
5. A ∧ P → L
6. A ∧ B → L
7. A
8. B
9. (4 pt) Forward-Chaining
10. (4 pt) Backward-Chaining

(4 pt) Resolution

Prove t → s:
1. p → q
2. [q ∧ r] → s
3. [t ∧ u] → r
4. u → w
5. t → y
6. y → u
7. r → p
8. p → m
9. (3 pt) Express in clause form
10. (5 pt) Forward-Chaining

iii. (5 pt) Backward-Chaining

(5 pt) Resolution

(40 pt) Consider the following stories:
1. “All dogs who are not tired and are smart are happy. Those dogs who do tricks are not stupid. Fido can do tricks and is full of energy. Happy dogs have exciting lives.”
  1. (2.5 pt) Translate the sentences of into predicate form
  2. (2.5 pt) Transform the predicate sentences into clause form

(5 pt) Prove via forward chaining that Fido has an exciting life

(5 pt) Prove via backward chaining that Fido has an exciting life
(5 pt) Prove via Resolution that Fido has an exciting life

“Anyone passing the history exams and winning the lottery is happy. But anyone who studies or is lucky can pass all the exams. John did not study, but he is lucky. Anyone who is lucky wins the lottery.”
1. (2.5 pt) Translate the sentences of into predicate form
2. (2.5 pt) Transform the predicate sentences into clause form

(5 pt) Prove via forward chaining that John is happy.

(5 pt) Prove via backward chaining that John is happy
(5 pt) Prove via Resolution that John is happy

Order an Essay Now & Get These Features For Free:

Turnitin Report

Formatting

Title Page

Citation

Outline

Place an Order