| 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=0co12g5q9mrk61ah37bmh5om3o; 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: 8955
content-type: text/html; charset=UTF-8
date: Tue, 13 Jan 2026 04:20:40 GMT
server: Apache
KIT – ITI Algorithm Engineering – Studium und Lehre - Lehrveranstaltungen - SAT Solving in der Praxis
SAT Solving in der Praxis
- Typ: Vorlesung / Übung (VÜ)
-
Ort:
50.34 Raum 301
-
Zeit:
Montag 15:45 - 17:15 Uhr
Dienstag 15:45 - 17:15 Uhr (14-täglich)
-
Dozent:
Prof. Dr. Peter Sanders
Dr. Markus Iser
Dr. Dominik Schreiber - SWS: 3
- LVNr.: 2400115
Lecture Goals:
- Efficient Methods for SAT Solving:
- Algorithms, Heuristics, Data Structures, Implementation Techniques, Parallelism, Proof Systems
- Applications of SAT Solvers:
- Verification of Hardware and Software, Planning, Scheduling, Cryptography, Explainable AI, ...
- Efficient Encodings of Problems into SAT:
- General Encoding Techniques, CNF Encodings of Constraints, Properties of CNF Encodings, ...
- Practical Hardness of SAT:
- Tractable Classes, Instance Structure, Hardest Instances, Proof Complexity, ...