Seminar Algorithms: Algorithms in Propositional Logic

In this seminar, we will study simple aspects of proof complexity for algorithms in propositional logic and familiarize ourselves with some fundamental papers.
This is what it's about:

In proof complexity, one tries to understand and analyze the computational resources required to prove or refute logical statements. More intuitively, one is interested in studying how to give short (and efficiently verifiable) proofs of the fact that a given CNF formula is unsatisfiable. The resolution calculus is one method how one can show unsatisfiability. This course will primarily focus on resolution as a proof system. Proof Complexity has not only a deep connection to the P vs. NP problem but also many exciting interrelations to the applied field of SAT Solving.

There are no specific requirements for participation in the seminar. However, students should demonstrate personal responsibility and initiative and be willing to familiarize themselves with a new topic.
Please note:
As usual, registration for the seminar will be handled centrally via Moodle: moodle.uni-ulm.de/course/view.php.

To participate in the course, it is mandatory to register for the Moodle course. All communication and topic assignments will be done via Moodle.
A preliminary list of topics:
General proof systems. Tree-like resolution. Exponential lower bound for resolution from the drawer principle. Combinatorial characterizations of width in resolution. Width and length in resolution. Memory requirements for resolution refutations. Length vs. memory space trade-off results. Resolution depth. The cutting plane proof system. Interpolation. Proof systems with symmetry rules. Resolution and SAT solving.
Your own topic suggestions are welcome at any time!

 Theme groups with a maximum of 2 students per group. Attendance: maximum of 2 absences, similar to ASQ. Presentation duration: 45-60 minutes per group (blackboard or projector). Paper: 10-15 pages per group (in LaTeX).
Both the presentation and the paper may be given in German or English.
We will explain the details in a preliminary meeting (see Moodle). The topics will also be assigned via Moodle.