Prof. Dr. Lutz Schröder









Lutz Schröder is the head of the Chair of Computer Science 8 (Theoretical Computer Science) at the Department of Computer Science of the Friedrich-Alexander-Universität Erlangen-Nürnberg.

E-mail: user Lutz.Schroeder, domain
Phone: +49 9131 85-64059
Fax: +49-9131-85-64055
Office: Martensstr. 3, 91058 Erlangen, Room 11.159


  • Best Theory Paper Award at FM 2019 for Generic Partition Refinement and Weighted Tree Automata (Hans-Peter Deifel, Stefan Milius, Lutz Schröder, Thorsten Wißmann)
  • Game-Based Local Model Checking for the Coalgebraic mu-Calculus (Daniel Hausmann, Lutz Schröder) at CONCUR 2019
  • Graded Monads and Graded Logics for the Linear Time – Branching Time Spectrum (Ulrich Dorsch, Stefan Milius, Lutz Schröder) at CONCUR 2019
  • A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic (Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König) at IJCAI 2019 (preprint)
  • Optimal Satisfiability Checking for Arithmetic mu-Calculi (Daniel Hausmann, Lutz Schröder) at FoSSaCS 2019
  • A Metalanguage for Guarded Iteration (Sergey Goncharov, Christoph Rauch, Lutz Schröder) wins best paper award at ICTAC 2018
  • Guarded Traced Categories (Sergey Goncharov, Lutz Schröder) wins EATCS Best Theory Paper Award at ETAPS 2018
  • A van Benthem Theorem for Fuzzy Modal Logic (Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König) at LICS 2018
  • Permutation Games for the Weakly Aconjunctive mu-Calculus (Daniel Hausmann, Lutz Schröder, Hans-Peter Deifel) at TACAS 2018
  • New DFG-Project Reconstructing Arguments From Noisy Text (RANT) (Stefan Evert, Lutz Schröder, in DFG SPP 1999 Robust Argumentation Machines (RATIO)) kicked off
  • New DFG-Project A High Level Language for Programming and Specifying Multi-Effect Algorithms (HighMoon II) (Sergey Goncharov, Lutz Schröder) kicked off
  • Completeness of Flat Coalgebraic Fixpoint Logics (L. Schröder, Y. Venema) in ACM TOCL (preprint)
  • A Characterization Theorem for a Modal Description Logic (P. Wild, L. Schröder) at IJCAI 2017
  • Efficient Coalgebraic Partition Refinement (U. Dorsch, S. Milius, L. Schröder, T. Wißmann) at CONCUR 2017
  • Automatic Verification of Application-Tailored OSEK Kernels (H.-P. Deifel, C. Dietrich, M. Göttlinger, D. Lohmann, S. Milius, L. Schröder) at FMCAD 2017
  • Ontological Modelling of a Psychiatric Clinical Practice Guideline (D. Gorin, M. Meyn, A. Naumann, M. Polzer, L. Schröder) at KI 2017
  • Nominal Automata with Name Binding (L. Schröder, D. Kozen, S. Milius, T. Wißmann) at FOSSACS 2017
  • Unifying Guarded and Unguarded Iteration (S. Goncharov, L. Schröder, C. Rauch and M. Pirog) at FOSSACS 2017
  • Probabilistic Description Logics for Subjective Uncertainty (V. Gutierrez-Basulto, J. Jung, C. Lutz, L. Schröder) in J. Artif. Intell. Res. (JAIR)
  • Check out COOL – The Coalgebraic Ontology Logic Reasoner.


  • List of publications; DBLP record; Google Scholar profile.
  • Research interests:
    • Formal Methods
    • Knowledge Representation
    • Logic in Computer Science
  • Current projects:
    • DFG project COAX2 – Coinduction meets algebra for the axiomatization of system equivalences (Stefan Milius, Lutz Schröder)
    • DFG project GenMod3 – Generic algorithms and complexity bounds in coalgebraic modal logic (Lutz Schröder)
    • DFG project ProbDL2 – Probabilistic Description Logic (Lutz Schröder)
    • DFG project HighMoon2 – A High Level Language for Monad Combination (Lutz Schröder, Sergey Goncharov)
    • DFG project RANT – Reconstructing Arguments from Noisy Text (Stefan Evert, Lutz Schröder) within DFG SPP 1999 Robust Argumentation Machines (RATIO)

Professional Activities

Slides of Selected Talks