This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 165A – Artificial Intelligence, Winter 2011 Assignment #4 – First-order logic Due Thursday, Feb 24 before the class Notes: ■ Be sure to re-read the “Policy on Academic Integrity” on the course syllabus. ■ Any updates or corrections will be posted on the Announcements page (home page for the course), so check there occasionally. ■ Hand in your copy in the class (please use word processing editor). ■ Important: Keep your answers precise. Avoid writing a monograph! A few sentences are plenty for each part of your answer. Problem #1 [10 points]: Verify if the following equivalences are true. B is a proposition. Explain your reasoning. 1. ( x P(x)) ˄ B ≡ ( x P(x) ˄ B) 2. ( x P(x)) ˅ B ≡ ( x P(x) ˅ B) 3. ( x P(x)) ˅ B ≡ ( x P(x) ˅ B) 4. ( x P(x)) ˅ ( x Q(x)) ≡ ( x P(x) ˅ Q(x)) 5. ( x P(x)) ˅ ( x Q(x)) ≡ ( x P(x) ˅ Q(x)) Problem #2 [10 points]: For each pair of atomic sentences, find a unifier if it exists. Upper case symbols indicate predicate For each pair of atomic sentences, find a unifier if it exists....
View Full Document
This note was uploaded on 02/22/2011 for the course CS 165A taught by Professor Su during the Spring '11 term at UCSB.
- Spring '11
- Artificial Intelligence