COMP60332: Automated Reasoning and Verification (2014-2015)

Announcements

• Lectures start in January

Course description

Follow this link for the course unit description, giving details about the aims and learning outcomes of the course, reading material, assessment, and the syllabus.

• Link to ACS Syllabus

Lecturers

• Konstantin Korovin
• Renate Schmidt

Locations and times

Coursework

Handing in your work

Please hand in your written coursework as a hard copy to the Student Support Office, Room LF21.

Slides

• Introduction to the Reasoning and Optimization Theme
• Please refer to Blackboard for the weekly slides

Other resources

• MiniSAT Website
• DIMACS -- format for propositional satisfiability
• SPASS Website
• SPASS Tutorial

Pre-requisites

Familiarity with basic notions of sets, relations and functions. This will not be covered in lectures, but will be part of the first coursework sheet.

If you want to refresh your knowledge on sets, relations and function we recommend

• Chapter 5.2 in Cormen, T. H. and Leiserson, C. E. and Rivest, R. L. (1992), Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series, MIT Press.
• Chapters 1.1, 1.2 and 1.3 of "Interactive Real Analysis". This website includes interactive exercises with answers.
• Any book on the mathematical foundations of CS or discrete mathematics.

Knowledge of propositional logic and first-order logic would be some advantage, but is not essential as the course will introduce these.

Reading material

The course does not follow a specific book: copies of the slides are made available.

Recommended reading material is listed in the course unit description in the ACS Syllabus. Further references may be given during lectures.

There is no need to buy a book. All books are available in the Resources Centre Library or the main library.

Assessment

50% coursework, 50% exam