|
MA410 Artificial Intelligence
References
MA426 Fourier Analysis
CS424 Object Oriented ProgrammingHTML,JAVA,PERLCS428 Advanced Operating Systems & Automated ReasoningThere will be a practical assessment in computing, carrying up to 30% of the total marksPropositional calculus: truth functions and propositional connectives, logical validity, an axiomatization and completeness meta-theorem. First order theories: axioms, theorems, interpretations, logical validity. Rules of inference: binary resolution, hyper-resolution, 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. |
||
Mathematics Department, Maths Physics Department, IT Department,
Physics Department.
|