Introduction to logic for computer scientists: an elementary exposition of propositional logic and predicate logic from a computational point of view, including introduction to interpretations, models, proof procedures, soundness, and completeness. Automated deduction: clausal form logic and Horn clause logic, skolemisation, the Herbrand domain, unification, resolution and resolution strategies. Logic Programming: data representation, operational views of unification and backtracking, the notion of logical variable, reversibility, non-logical features, meta-programming, introduction to constraint logic programming and other paradigms. Lab: programming assignments in Prolog. Extensive practical work.

CSE class page: www.cse.unsw.edu.au/~cs2411