CSC 261 : Exam 2
CSC 261 - Artificial Intelligence - Weinman
1 Learning Outcomes
At the end of this unit you should be able to
- Define entailment, completeness, and soundness
- Translate English into syntactically correct sentences of propositional
logic
- Give the semantics (truth tables) for all the standard propositional
logic connectives (not, and, or, implication, bidirectional implication)
- Determine whether a given model is a model of a given propositional
sentence (i.e., apply PL-TRUE?)
- Convert any sentence of propositional logic to CNF
- Use resolution on CNF clauses to decide entailment in propositional
logic
- Apply forward chaining to a propositional logic knowledge base
- Use backward chaining on Horn clauses to decide entailment in propositional
logic
- Contrast the applications of propositional forward and backward chaining
- Translate English into syntactically correct sentences of first-order
logic
- Give a most-general unifier for two sentences of first-order logic
- Apply forward or backward chaining to prove a sentence of first-order
logic from a given knowledge base of Horn clauses
- Write Prolog rules for both basic and recursive cases
- Use the product and sum rules, along with the laws of Boolean logic,
to calculate certain probabilities
- Apply the principle of indifference to assign reasonable prior probabilities
2 Study Problems
The following exercises are from Russel and Norvig (Third Edition)
- Chapter 7
- 1, 4-7, 9, 12, 14, 18
- Chapter 8
- 2, 3, 4, 6, 7, 8, 9, 10, 21, 24
- Chapter 9
- 3, 4, 6, 7(a), 9, 10, 18, 19, 24(a-e),
The following exercises are from Russel and Norvig (Second Edition...the
green one)
- Chapter 7
- 5, 11(a,b),
- Chapter 8
- 7