| CARVIEW |
Select Language
HTTP/2 200
expires: Thu, 19 Nov 1981 08:52:00 GMT
cache-control: no-store, no-cache, must-revalidate
pragma: no-cache
set-cookie: PHPSESSID=i8iqrdgiiatj2ncopf9i66aos0; path=/; secure; HttpOnly
vary: Accept-Encoding
content-encoding: gzip
x-content-type-options: nosniff
reporting-endpoints: csp-report="/global-cgi-bin/csp-report"
content-security-policy-report-only: frame-ancestors 'self' https://*.kit.edu; report-uri /global-cgi-bin/csp-report; report-to csp-report
strict-transport-security: max-age=31556952
content-length: 8818
content-type: text/html; charset=UTF-8
date: Wed, 14 Jan 2026 20:08:06 GMT
server: Apache
KIT – ITI Algorithm Engineering – Studium und Lehre - Lehrveranstaltungen - Fortgeschrittene Themen im SAT Solving
Fortgeschrittene Themen im SAT Solving
- Typ: Seminar (S)
-
Ort:
Geb. 50.34, Raum 211
-
Zeit:
- Auftaktveranstaltung: Donnerstag 9.11., 14 Uhr
- Vortragstermine: nach Vereinbarung
-
Dozent:
Prof. Dr. Peter Sanders
Dr. Markus Iser
Dominik Schreiber - SWS: 2
- LVNr.: 2400020
- Hinweis: Präsenz
| Inhalt | This seminar covers new topics and recent advances in propositional satisfiability and optimization. Topics include parallel SAT, algorithm portfolios, maximum satisfiability, and proof production and checking. We prepare bundles of two papers for the first session, usually one recent and one classic. You may choose one of the bundles to prepare a presentation on at the end of the semester. |
| Vortragssprache | Deutsch/Englisch |