Automata Theory
Learning Theory
- Exact learning of deterministic finite automata
- Exact learning of multiplicity automata
- Online convex optimization
- Principal Component Analysis
- Rademacher Complexity
- Margin-Based Generalisation Bounds for SVMs
- Computational Learning Theory (FoPPS Summer School)
Introduction to Logic
Lectures- Propositional Logic
- Polynomial-Time Formula Classes
- Resolution and Interpolation
- Lower Bounds for Resolution
- Cutting Planes
- Compactness Theorem
- First-Order Logic
- Decidable Theories I I
- Decidable Theories II
- Algebraically Closed Fields
- Ehrenfeucht-Fraisse Games
- Herbrand's Theorem and Ground Resolution
- Examples of Ground Resolution
- Undecidability of Validity and Satisfiability
-
Resolution for Predicate Logic
Exercise Sheets
Supplementary Material
- Lecture slides and other material avaiable on request to instructors