Lukas Gerlach

Lukas Gerlach is a Research Associate and doctoral student at the International Center for Computational Logic (ICCL) within the Faculty of Computer Science at TU Dresden. His primary research focuses on existential rules, the Chase algorithm, database theory, logic, and complexity theory. He actively contributes to formal verification using the Lean theorem prover and develops the Nemo rule reasoning toolkit.

His academic activities include teaching courses such as Database Theory, Theorem Proving with LEAN, and Complexity Theory. He collaborates on projects like Nemo (scalable Datalog engine) and CPEC (perspicuous computing systems). His work emphasizes theoretical foundations while producing practical implementations for knowledge representation and reasoning.

Recent research trends show a strong focus on formalizing logical systems (e.g., infinite trees in Lean), analyzing Chase termination conditions, and improving Datalog-based systems' explainability through tools like EvonNemo. His publications span venues like ITP, PODS, and KR, addressing topics from foundational theory to engineering scalable reasoning systems.

Gerlach also contributes to open-source projects such as Adf-bdd for abstract dialectical frameworks and maintains strong ties with the international knowledge representation community through conference involvement.