Lectures

Organisation

The course is divided into two parts in which decision problems are modelled by logical formula for which efficient algorithms are presented to prove satisfiability or not:

• Propositional logic with an emphasis on Artificial Intelligence.
  
• First order logic with an emphasis on System verification.
  

The course will take place at Ecole polytechnique in Room PC1 except when indicated otherwise in the schedule.

General information on the course

Final evaluation

The final evaluation will be performed with the presentation of a scientific papers.

Documents

Clicking the title of the week’s lecture will go to a PDF, embedded in the user’s browser, by default.

• Week 1 (January 9, 2025 (Room: Turing building)), Propositional logic and modelling -- Practical work sheet -- Solutions
  Teacher: Alexandre Chapoutot
  Summary: This lecture aims at introducting (recalling) basic elements on propositional logic and showing some examples on how to encode decision problems with Boolean formula.
  MCQ of the week open from January 16, 2025 at 12h00 to January 23, 2025 at 12h (Paris time)
• Week 2 (January 16, 2025), Algorithms into SAT solvers -- Practical work sheet -- Solutions
  Teacher: Alexandre Chapoutot
  Summary: This lecture aims at presenting the main algorithms (namely DPLL and CDCL) to solve satisfiability problems of Boolean formula.
  MCQ of the week open from January 16, 2025 at 12h00 to January 23, 2025 at 12h (Paris time)
• Week 3 (January 23, 2025 (Room: Turing building)), AI applications -- Practical work sheet
  Teacher: Alexandre Chapoutot
  Summary: This lecture aims at presenting several AI applications of Boolean formula models for decision problems.
  MCQ of the week open from at 12h00 to #December 16, 2022 at 12h (Paris time)
• Week 4 (January 30, 2025), First order logic and modelling -- Practical work sheet (Practical work material)
  Teacher: Sergio Mover
  Summary: This lecture aims at introducing (recalling) first order logic and showing some examples on how to encode decision problems with first-order logic formula.
  MCQ of the week open from January 30, 2025 at 12h00 to February 2, 2025 at 12h (Paris time)
• Week 5 (February 6, 2025), Equality and Uninterpreted Functions (EUF) Theory -- Practical work sheet (Practical work material)
  Teacher: Sergio Mover
  Summary: This lecture aims at presenting theory solver for EUF theory.
  MCQ of the week open from February 6, 2025 at 12h00 to February 8, 2025 at 12h (Paris time)
• Week 6 (February 13, 2025), Linear (Real/Integer) Artithmetic Theories -- Practical work sheet (Practical work material)
  Teacher: Sergio Mover
  Summary: This lecture aims at presenting theory solvers for linear arithmetic focusing on real and integer artithmetics.
  MCQ of the week open from February 13, 2025 at 12h00 to February 15, 2025 at 12h (Paris time)
• Week 7 (February 20, 2025), System Verification Applications -- Practical work sheet (Practical work material)
  Teacher: Sergio Mover
  Summary: This lecture aims at presenting several system verification applications with first order formula.
  MCQ of the week open from February 20, 2025 at 12h00 to February 22, 2025 at 12h (Paris time)
• Week 8 (February 27, 2025 or March 6, 2025), Exam
  Teacher: Alexandre Chapoutot and Sergio Mover
  Summary: Final evaluation by an oral presentation of a scientific paper.