Information about the course Automated Reasoning (2IMF25)

This course will be given in the fall of 2016, in the second quartile.
Lectures from 2013 (having code 2IW15) are available on video

Teacher: Prof Dr H. Zantema, Metaforum 6.078, tel 2749, h.zantema@tue.nl

Students from the Radboud University in Nijmegen that (want to) follow this course should go to special information for Radboud University

Goal:
Obtaining insight how various problems can be transformed to formulas, and can be solved automatically by computer programs manipulating these formulas.


Contents:
Many problems, in particular in the area of verification of computer systems, can be expressed as proving that some big formula is always true. In this course we will concentrate on various methods for treating this kind of problems. Not only correctness and completeness of these methods will be considered, also efficiency and usability. In particular we will consider:



Examination:
The examination consists of two parts: a written exam and a practical assignment. The written exam is `closed book': no use of books or notes is permitted during the exam. The practical assignment is done by at most two persons. In case the practical assignment is done by two persons, each of them should be responsible for the whole work, possibly checked by an individual test. The practical assignment has two deadlines: December 12, 2016 for the first part, and January 12, 2017 for the second part.
The reports of the practical assignment should be handed in on paper (printed two-sided, preferably less than 20 pages). This can be done at the lecture, or at the office MF6.078 of the lecturer, or in his mail box opposite to room MF6.085.
The results of both parts of the practical assignment (December 2016 and January 2017) and the examination of January 23, 2017

For both the written exam and the practical assignment, the grade should be at least 5.0. In that case the final grade is the average of both parts, each having the same weight. Otherwise the final grade is the minimum of both parts.


To be downloaded:


Some of the material of the course is based on the books:

S. N. Burris:
Logic for Mathematics and Computer Science
Prentice Hall, 1998, ISBN 0-13-285974-2

C. Meinel and T. Theobald:
Algorithms and Data Structures in VLSI Design
Springer, 1998, ISBN 3-540-64486-5

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein:
Introduction to Algorithms
MIT Press, 2009, ISBN 978-0-262-53305-8
Third Edition, only Chapter 29


Lectures and topics (updated after every lecture; slides refer to version of November 2016):


date topic slides
Monday, November 14 Overview, pigeon hole formula, SAT is NP-complete, arithmetic (addition) in SAT 1 to 33
Thursday, November 17 Multiplication, program correctness by SAT, resolution, Davis-Putnam procedure 33 to 59
Monday, November 21 Completeness of resolution, DPLL, conflict driven clause learning 60 to 86
Thursday, November 24 Conflict driven clause learning, Tseitin transformation 87 to 109
Monday, November 28 Linear programming: Simplex method, SMT solving 110 to 141
Thursday, December 1 SMT solving, ILP is NP-hard, unique representation, reachability 142 to 165
Monday, December 5 NuSMV, Decision trees and BDDs 166 to 194
Thursday, December 8 BDDs, predicate logic 195 to 223
Monday, December 12 Predicate logic, resolution, unification 224 to 246
Thursday, December 15 Unification, resolution, Prolog, prenex normal form, Skolemization, Prover9 247 to 262
Monday, December 19 Equational reasoning, term rewriting: main properties, termination undecidable 263 to 278
Thursday, December 22 Termination by monotone interpretations and lexicographic path order, well-founded induction, Newman's Lemma 279 to 297
Monday, January 9 Term rewriting: critical pairs, word problem, Knuth-Bendix completion 298 to 315
Thursday, January 12 Critical pairs, overview course, old exam (last lecture) 316 to 318



Last change: January 26, 2017