COMP21111: Logic and Modelling (2011-2012)
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.
|Programme outcome||Unit learning outcomes||Assessment|
|A1 A2||Have a knowledge about basic reasoning (or satisfiability-checking) algorithms for propositional logic.|
|A1 A2||Have a knowledge of quantified boolean formulas and basic understanding of bound variables and quantifiers.|
|A1 A2||To understand BDDS (binary decision diagrams) as a data structure for compact representation of propositional formulas.|
|A1 A2 B1 C5||Have 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.|
|A2||Have a knowledge of simple temporal logics.|
|A1 A2 A5 B1||Be able to formally specify finite-state concurrent systems as transition systems.|
|A1 A2 B1||Be able to specify properties of simple transition systems in temporal logics.|
Available on the course Web page.
The reading material is a collection of notes available on the course Web page. In addition, slides used during lectures are available on the course Web page as well.