Automated reasoning (2014/2015)

Course code
Name of lecturer
Maria Paola Bonacina
Maria Paola Bonacina
Number of ECTS credits allocated
Academic sector
Language of instruction
I sem. dal Oct 1, 2014 al Jan 30, 2015.
Web page

Lesson timetable

I sem.
Day Time Type Place Note
Tuesday 4:30 PM - 6:30 PM lesson Lecture Hall I  
Thursday 4:30 PM - 6:30 PM optional practice session Lecture Hall F  
Friday 11:30 AM - 1:30 PM lesson Lecture Hall I from Oct 9, 2014  to Oct 24, 2014
Friday 11:30 AM - 1:30 PM lesson Lecture Hall C from Oct 31, 2014  to Jan 30, 2015

Learning outcomes

The class presents problems, methods and systems in automated reasoning. The treatment combines theoretical foundations with algorithmic and practical issues, emphasizing mechanization throughout. The student learns how to design, apply, and evaluate methods and systems for automated reasoning, with attention to applications in analysis, verification, synthesis of systems, and artificial intelligence.


Foundations of automated reasoning: theorem proving and model building. Inference systems, such as: instance-based (e.g., hyper-linking), ordering-based (e.g., resolution), and subgoal-reduction based (e.g., model elimination). Search plans. Algorithmic reasoning in specific fields, such as: decision procedures for satisfiability modulo theories (SMT); constraint-based reasoning. Design and use of general-purpose or special-purpose reasoners.

Reference books
Author Title Publisher Year ISBN Note
Ricardo Caferra, Alexander Leitsch, Nicolas Peltier Automated Model Building (Edizione 1) Kluwer Academic Publishers 2004 1-4020-265 Lettura supplementare
Daniel Kroening, Ofer Strichman Decision Procedures. An algorithmic point of view Springer 2008 978-3-540-74104-6 Libro di testo
Rolf Socher-Ambrosius, Patricia Johann Deduction Systems (Edizione 1) Springer Verlag 1997 0387948473 Lettura supplementare
Raymond M. Smullyan First-order logic Dover Publications 1995 0486683702 Lettura supplementare
Allan Ramsay Formal Methods in Artificial Intelligence (Edizione 1) Cambridge University Press 1989 0521424216 Lettura supplementare
Chin-Liang Chang, Richard Char-Tung Lee Symbolic Logic and Mechanical Theorem Proving (Edizione 1) Academic Press 1973 0121703509 Libro di testo
Alexander Leitsch The Resolution Calculus (Edizione 1) Springer 1997 3540618821 Lettura supplementare
Martin Davis The Universal Computer. The Road from Leibniz to Turing. Turing Centenary Edition. Taylor and Francis Group 2012 978-1-4665-0519-3 Lettura supplementare

Assessment methods and criteria

The grade is given by 30% C1 + 30% C2 + 40% P, where C1 is the midterm exam, C2 is the final exam and P is a project. The grade thus generated is registered at the first exam session in February.
For all other sessions, the grade is given by 100% E, where E is a written test, hard enough to match the difficulty of C1 + C2 + P.
Registration: all grades will be registered.
Withdrawal: Students may withdraw by informing the instructor.
Cheating: All tests and projects are individual work. Cheating is strictly forbidden and will determine lowering of grades.