Syllabus  CS421
MA410 Artificial Intelligence

Review of logic

Propositional calculus, truth tables, conjunctive and disjunctive normal
forms, arguments

Predicate calculus, Skolemisation, clause form, resolution

Searching: Breadth first, depth first and best first search in a state
space

Twoperson games, the minimax procedure, alpha beta pruning

Introduction to PROLOG

Facts, rules, queries, backtracking, lists

Searching, production systems
References

I. Bratko, "PROLOG programming for artificial intelligence" (Addison Wesley)

G.F. Luger and W.A. Stubblefield, "Artificial intelligence and the design
of expert systems" (Benjamin Cummings)
MA426 Fourier Analysis

Fourier series. The RiemannLebesgue Theorem. The Dirichlet condition for
convergence. The Gibbs Phenomenon. Fejer kernels and Cesaro summation of
Fourier series.

Fourier transforms on R. L_{1} and L_{2}
functions. The Plancherel Theorem. Bandlimited functions and the Shannon
Sampling Theorem. convolution and filtering.

Discrete Fourier transforms. The Fast Fourier transform and its applications.
Digital filtering.
CS424 Object Oriented Programming
HTML,JAVA,PERL
CS428 Advanced Operating Systems & Automated Reasoning
There will be a practical assessment in computing, carrying up to 30% of the total marks
Propositional calculus: truth functions and propositional connectives, logical validity, an axiomatization and completeness metatheorem.
First order theories: axioms, theorems, interpretations, logical validity.
Rules of inference: binary resolution, hyperresolution, demodulation, subsumption, proof by contradiction.
The set of Support Strategy (and weighting). Introduction to UNIX on Dangan workstations.
Using the OTTER computer package: puzzles, logic circuit design/validation, theorem proving.
A first order for Peano arithmetic.
Godel's Incompleteness Theorem: statement, indication of proof (Godel numbers, recursive functions, represntable functions), relevance to automated theorem proving.
Back to 4th Year Syllabus