Automated reasoning (2011/2012)

Course code
Name of lecturer
Maria Paola Bonacina
Maria Paola Bonacina
Number of ECTS credits allocated
Academic sector
Language of instruction
I semestre dal Oct 3, 2011 al Jan 31, 2012.
Web page

Lesson timetable

I semestre
Day Time Type Place Note
Tuesday 11:30 AM - 1:30 PM lesson Lecture Hall C  
Wednesday 4:30 PM - 6:30 PM lesson Lecture Hall I  

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 fields such as HW/SW verification, artificial intelligence, mathematics, robotics.


Automated theorem proving. Choice of inference systems: instance-based, ordering-based (resolution, superposition, rewriting),
subgoal-reduction (model elimination). Search plans. Algorithmic reasoning in specific fields, e.g.: decision procedures for satisfiability modulo theories; reasoning with uncertainty; reasoning in multi-agent systems. 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
Daniel Kroening, Ofer Strichman Decision Procedures. An algorithmic point of view Springer 2008 978-3-540-74104-6
Rolf Socher-Ambrosius, Patricia Johann Deduction Systems (Edizione 1) Springer Verlag 1997 0387948473
Raymond M. Smullyan First-order logic Dover Publications 1995 0486683702
Allan Ramsay Formal Methods in Artificial Intelligence (Edizione 1) Cambridge University Press 1989 0521424216
Chin-Liang Chang, Richard Char-Tung Lee Symbolic Logic and Mechanical Theorem Proving (Edizione 1) Academic Press 1973 0121703509
Alexander Leitsch The Resolution Calculus (Edizione 1) Springer 1997 3540618821

Assessment methods and criteria

The grade is given by 30% C1 + 30% C2 + 40% P, where C1 is a written test (midterm exam), C2 is a written test (final exam) and P is a project. The grade thus generated is registered at the first exam session in February.
Alternatively, the grade is given by 100% E, where E is a written test, hard enough to match the difficulty of C1 + C2 + P.
Registration: it is not possible to reject a grade and all grades are registered. Withdrawal: Students may withdraw by informing the instructor. All tests and projects are to be carried out individually. Cheating is strictly forbidden and will determine lowering of grades for all students involved.