Skip to navigation | Skip to main content | Skip to footer

This is an archived syllabus from 2014-2015

COMP21111 Logic and Modelling syllabus 2014-2015

COMP21111 Logic and Modelling

Level 2
Credits: 10
Enrolled students: 131

Course leader: Andrei Voronkov

Additional staff: view all staff

Additional requirements

  • Pre-requisites

    COMP11120 or (MATH10111 and MATH10131 and MATH10212 and MATH10232)

Assessment methods

  • 80% Written exam
  • 20% Coursework
Sem 1 Lecture Zochonis TH A Fri 15:00 - 16:00 -
Sem 1 Lecture Zochonis TH A Thu 16:00 - 17:00 -
Sem 1 w3+ Examples LF15 Mon 15:00 - 16:00 J
Sem 1 w3+ Examples LF15 Mon 16:00 - 17:00 K
Themes to which this unit belongs
  • Rigorous Development


This is a unique course developed at the University of Manchester. It explains how implementations of logic can be used to solve a number a number of problems, such as solving hardest Sudoku puzzles in no time, analysing two-player games, or finding serious errors in computer systems


This course intends to build an understanding of fundamentals of (mathematical) logic as well as some of the applications of logic in modern computer science, including hardware verification, finite domain constraint satisfaction and verification of concurrent systems.


Available on the course Web page.

Teaching methods


22 in total, 2 per week, including some feedback sessions on exercises

Feedback methods

My Website of this course will contain a lot of material, including solutions to exercises

Study hours

  • Assessment written exam (2 hours)
  • Lectures (24 hours)
  • Practical classes & workshops (9 hours)

Employability skills

  • Analytical skills
  • Innovation/creativity
  • Problem solving
  • Research

Learning outcomes

Programme outcomeUnit learning outcomesAssessment
A1 A2Have a knowledge about basic reasoning (or satisfiability-checking) algorithms for propositional logic.
  • Examination
A1 A2Have a knowledge of quantified boolean formulas and basic understanding of bound variables and quantifiers.
  • Examination
A1 A2To understand BDDS (binary decision diagrams) as a data structure for compact representation of propositional formulas.
  • Examination
A1 A2 B1 C5Have a knowledge about applications of propositional logic (such as finite domain constraint satisfaction and planning) and be able to apply it for solving hard combinatorial problems.
  • Examination
A2Have a knowledge of simple temporal logics.
  • Examination
A1 A2 A5 B1Be able to formally specify finite-state concurrent systems as transition systems.
A1 A2 B1Be able to specify properties of simple transition systems in temporal logics.
  • Examination

Reading list

COMP21111 does not have a specified reading list.

Additional notes

Course unit materials

Links to course unit teaching materials can be found on the School of Computer Science website for current students.

Links related to COMP21111