Navigation

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 fau.de
Phone: +49 9131 85-64059
Fax: +49-9131-85-64055
Office: Martensstr. 3, 91058 Erlangen, Room 11.159

Highlights

  • DFG project  Spectra of Behavioural Distances and Quantitative Logics (Barbara König, Lutz Schröder) kicked off
  • A Linear-Time Nominal mu-Calculus with Name Allocation (Daniel Hausmann, Stefan Milius, Lutz Schröder) at MFCS 2021
  • Explaining Behavioural Inequivalence Generically in Quasilinear Time (Thorsten Wißmann, Stefan Milius, Lutz Schröder) at CONCUR 2021
  • Nominal Büchi Automata with Name Allocation (Henning Urbat, Daniel Hausmann, Stefan Milius, Lutz Schröder) at CONCUR 2021
  • Behavioural Preorders via Graded Monads (Chase Ford, Stefan Milius, Lutz Schröder) at LICS 2021
  • Quasipolynomial Computation of Nested Fixpoints (Daniel Hausmann, Lutz Schröder) at TACAS 2021
  • A Quantified Coalgebraic van Benthem Theorem (Paul Wild, Lutz Schröder) at FoSSaCS 2021
  • DFG project Reconstructing Arguments from Newsworthy Debates (Stefan Evert, Lutz Schröder) kicked off
  • Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions
    (Paul Wild, Lutz Schröder) at CONCUR 2020
  • Automata Learning: An Algebraic Approach (Henning Urbat, Lutz Schröder) at LICS 2020
  • NP Reasoning in the Monotone mu-Calculus (Daniel Hausmann, Lutz Schröder) at IJCAR 2020
  • DFG project Coalgebraic Model Checking (Stefan Milius, Lutz Schröder) kicked off
  • 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
  • Check out COOL – The Coalgebraic Ontology Logic Reasoner.

Research

  • 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