Topic Student Info
Alternating Weighted Automata Gustav Grabolle A3
Combinatory Categorial Grammars Lena Schiffer S3
Compositionality in Probabilistic Model Checking Linda Herrmann A1
Computing Preferred Models in Description Logics Willi Hieke S3
Explications for Probabilistic Model Checking Simon Jantsch A3
Knowledge Representation Formalisms under Non-Standard Semantics — Computational Properties and Practical Reasoning Lukas Schweizer A2
Model-theoretic Characteristics of Decidable Knowledge Representation Thomas Feller A3
Polynomial Time Combinations of Decision Procedures for Constraint Satisfaction Problems Johannes Greiner A2
Stream Reasoning using Temporalized Description Logics Christian Alrabbaa A3
User-Definable Concrete Domains Jakub Rydval S3
Valued Constraint Satisfaction Problems over Infinite Domains Simon Knäuer S3
Verification of Counter Automata Danny Richter A3
Weight Accumulation and Probabilistic Model Checking Sascha Wunderlich S1
Weighted Tree Substitution Kevin Stier A3


Info Legend:

A - Originally Associated
S - Originally Scholarship Holder
1 - First Generation
2 - Second Generation
3 - Third Generation