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- Introduction
- Propositional Logic
- Equivalence and Normal Forms
- Polynomial-Time Formula Classes
- Resolution
- The DPLL Algorithm
- Lower Bounds for Resolution
- Compactness
- First-Order Logic
- Normal Forms for First-Order Logic
- Herbrand's Theorem and Ground Resolution
- Examples of Ground Resolution
- Undecidability of Validity and Satisfiability
- Resolution for Predicate Logic
- Decidable Theories
- Games and Expressiveness
- Lecture slides and other material avaiable on request to instructors