Topics covered since midterm exam.

Mendelson, sections 2.9,2.10
Schoning, sections 1.2-1.5,2.2,2.3,2.4,2.5,2.6,3,1,3.2,3.3,3.4

Mendelson 2.9,2.10
adding function symbols and constants by definition, Prenex Normal Form

Section 1.2-1.5 [Schoning]
Conjunctive Normal Form, Horn formulas, compactness theorem, Resolution,
derivation of the empty clause

Section 2.2 [Schoning]
Rectification, RPF, Skolem functions, Skolem form

Schoning, section 2.3
Undecidability, semi-decision algorithms, Post Correspondence Problem,
undecidability of validity problem
Schoning, section 2.4
Herbrand universe, Herbrand structures(models), Lowenheim-Skolem theorem,
Herbrand's theorem, Gilmore's procedure
section 2.5
Ground resolution theorem (pg. 82), unification algorithm, most general
unifier, lifting lemma, Resolution Theorem (correctness, completeness)
section 2.6
Refinements: N-restriction, P-restriction, linear resolution, set of support
restriction, SLD-resolution, completeness of these restrictions (but
SLD-resolution and unit resolution are complete only for Horn clauses)
section 3.1
Answer predicate
section 3.2
Horn clause programs, facts, program clauses (rules), definite clauses, goals,
queries, halting clause, procedural interpretation, procedural semantics,
model theoretic semantics, their equivalence
section 3.3
Type 1 and type 2 nondeterminism, swapping lemma, canonical computation
(eliminates type 2 nondeterminism), completeness of breadth-first search,
PROLOG evaluation strategy
section 3.4
incompleteness of PROLOG, distinction between logic programming and PROLOG,
cut operation, negation as failure (\+), lists, list differences, memoizing

From lecture notes (ln17, ln18, ln19, ln20, ln21, ln22, ln23)
Temporal logic, eventually, always, Propositional Temporal Logic (PTL),
concurrent programs, model checking, symbolic model checking, programs as games,
reachability game, safety game, system vs environment, transition formula,
winning strategies, strategy automaton, STRIPS operators,
states represented by assignments of values to variables, states represented by
sets of atomic formulas that describe a state,
paramodulation, weakest preconditions, analytic tableaux,
DPLL algorithm