184.774 Automated Deduction
Diese Lehrveranstaltung ist in allen zugeordneten Curricula Teil der STEOP.
Diese Lehrveranstaltung ist in mindestens einem zugeordneten Curriculum Teil der STEOP.

2020S, VU, 4.0h, 6.0EC
TUWEL

Merkmale

  • Semesterwochenstunden: 4.0
  • ECTS: 6.0
  • Typ: VU Vorlesung mit Übung

Lernergebnisse

Nach positiver Absolvierung der Lehrveranstaltung sind Studierende in der Lage Methoden von Automated Deduction zu erklaeren und benuetzen, wie zB SAT/SMT Solving und Superposition-Reasoning.

Due to the recent drastical developments in the COVID-19 coronavirus, all lectures between March 11 - (at least) April 16 will be held online. Lecture recordings and slides will be posted online on the TUWEL site of the course, with course-related discussions monitored online.

 

The reasoning power that computational logic offers brings new perspectives in the field of program verification. This course is about computational logic, with particular focus on algorithmic and automated methods for proving logical properties.

The course aims at teaching attendees algorithmic techniques and fundamental results in automated deduction. Student will also use state-of-the-art theorem provers for proving logical properties.

Inhalt der Lehrveranstaltung

The course focuses on specialised algorithms for reasoning in various fragments of first-order logics, such as propositional logic, combination of ground theories, and full first-order logic with equality. We will address both the theoretical and practical aspects for using and implementing (semi-)decisions procedures of various logics.

The tentative list of topics covered by the course is below:

  • propositional and first-order logic;
  • satisfiability checking in propositional logic (splitting, DPLL, randomized algorithms);
  • satisfiability checking in the theory of arithmetic, uninterpreted functions and arrays;
  • satisfiability checking the the combination of theories (SMT);
  • validity proving in first-order logic (superposition theorem proving). 

The course will address transformation to normal forms, DPLL, SAT-solving, SMT-solving, resolution, unification, superposition, redundancy checking, and  experiments with theorem provers.

The course will also include hands-on sessions using the SAT solver MINISAT, the SMT solver Z3 and the first-order theorem prover VAMPIRE.

Methoden

There will be two lectures a week, with lecture slides online accompanying the lectures. 

Exercises will be discussed during the lecture, and homeworks will be made online.

Due to the recent drastical developments in the COVID-19 coronavirus, lecture recordings and slides will be posted online on the TUWEL site of the course. 


There will be 5 homeworks, handed out online. 

Corrected homeworks will be returned to students and discussed upon request in the regular course slot.  Homework solutions will also be discussed during regular lecture time.

There will be two recap sessions: mid-term and end of course.

Prüfungsmodus

Schriftlich

Weitere Informationen

The course is held block, within 8 weeks, with 2 lectures a week

The first lecture is on March 5, 9:15--10:45, in EI 3 Sahulka HS.

Due to the recent drastical developments in the COVID-19 coronavirus, lecture recordings and slides will be posted online on the TUWEL site of the course. 



Vortragende Personen

Institut

LVA Termine

TagZeitDatumOrtBeschreibung
Do.09:00 - 11:0005.03.2020 - 12.03.2020EI 3 Sahulka HS - UIW LVA Automated Deduction
Di.10:00 - 12:0010.03.2020EI 8 Pötzl HS - QUER LVA Automated Deduction
Automated Deduction - Einzeltermine
TagDatumZeitOrtBeschreibung
Do.05.03.202009:00 - 11:00EI 3 Sahulka HS - UIW LVA Automated Deduction
Di.10.03.202010:00 - 12:00EI 8 Pötzl HS - QUER LVA Automated Deduction
Do.12.03.202009:00 - 11:00EI 3 Sahulka HS - UIW LVA Automated Deduction

Leistungsnachweis

The course grade will be based on five written homework assignments and a written exam.

Homework assignments count for 40% of the course grade.

The date and place of the final written exam will be announced later. Students are allowed to bring one A4-size sheet of hand-written notes to the exam. No other material is allowed.

LVA-Anmeldung

Von Bis Abmeldung bis
11.02.2020 08:00 16.03.2020 23:59 20.03.2020 23:59

Curricula

StudienkennzahlVerbindlichkeitSemesterAnm.Bed.Info
066 011 DDP Computational Logic (Erasmus-Mundus) Keine Angabe
066 931 Logic and Computation Gebundenes Wahlfach
066 937 Software Engineering & Internet Computing Gebundenes Wahlfach
066 938 Technische Informatik Gebundenes Wahlfach
860 GW Gebundene Wahlfächer - Technische Mathematik Gebundenes Wahlfach

Literatur

For slides and other material see the TUWEL course.

Weitere Informationen

Sprache

Englisch