AI2 Module 2: hints for exam revision
The examinable material is that presented in the lectures, the
tutorials and in the assignment. Lecture material is quite closely
reflected in the copies of lecture slides that were distributed.
These slides contain references to the particular sections of
the text (Russell & Norvig) covering the relevant material.
Questions posed in tutorials should be of particular use in exam
revision. Sample answers are now given with each tutorial.
Here are things that the exam may ask you to do:
- Give brief explanations of such key terms as: unification,
substitution, weak/strong equivalence (of languages),
weak/strong adequacy (of grammars), local/global
ambiguity, derivation
- Show how aspects of a situation can be represented in First-Order
Logic (FOL).
- Give the most general unifier (or any unifying substitution)
for pairs of terms.
- Carry out a simple proof using generalised modus ponens (GMP) or
resolution refutation on a set of formulae in the appropriate logical form.
- Translate simple English sentences into logical representations
for use with GMP or with resolution refutation.
- Eliminate clauses from a Knowledge Base that cannot contribute to
a resolution refutation proof of a particular statement.
- Show how a concept or set of concepts can be represented in
Description Logic.
- Say where particular languages fall within the Chomsky hierarchy.
- Given a grammar, specify a corresponding automaton (or vice
versa).
- Identify a set of rules (i.e., a grammar) that generates a given
language.
- Explain whether or not a string is ambiguous with respect to a
given grammar.
- Give one or more analyses of a sentence according to a given
Definite Clause Grammar (DCG).
- Fill in the chart entries in order for a left-to-right CKY parse
of a sentence according to a given DCG.
- Explain when you would use a chart parser, rather than the
standard processor used with a DCG.
- Write an interpretation rule that pairs with a particular grammar
rule, to produce a logical form representation of a sentence that the
rule would be used in parsing.
- Describe a simple harmonic pattern.
The exam question WON'T:
- Ask you to write any Prolog code.
- Ask you to write a long essay.
Back to the AI2 Module 2 home page
This page is maintained by the course lecturer, Bonnie Webber, Room 10, 2 Buccleuch Place (
bonnie@cogsci.ed.ac.uk)
