Classical and non-classical logics pervade all aspects of Computer Science. They are essential, among other things, in assuring software quality. Computer scientist therefore need to be familiar with concepts and techniques related to formal systems and automated inference. This course is particularly relevant to ISI and SLE students.
1. Propositional logic : semantic tableaux, Davis and Putnam’s method, resolution, formal systems, compactness theorem. Algebraic approach to propositional logic.
2. First-order terms. Term equations. Substitutions. Unification algorithm.
3. First-order logic. Expressiveness. Semi-decision procedure. Prenex normal form, Lowenheim-Skolem theorem, Herbrand theorem. Semantic tableaux and resolution methods.
4. Programming with logic, specification, strategy. Illustrative programs.Prerequisites
1 written examination (3h) at the end of the period.
N1 = (E1 + E2)/2
N2 = E3
The course exists in the following branches:
Course ID : 3MM1LPI
The course is attached to the following structures:
You can find this course among all other courses.
Polycopié du cours, contenant les énoncés de tous les exercices à faire en TD ainsi que leurs corrigés
Course notes containing the solutions to all proposed problems.
Date of update January 15, 2017