Welcome to the

Dresden's new home for knowledge technologies and logic in computer science.
Our groups

Research groups introduced:

Logic Programming and Argumentation

Sarah Alice Gaggl

The research group Logic Programming and Argumentation at the faculty of informatics, Institute of Artificial Intelligence deals with theoretical and practical aspects of logic programming in particular with answer set programming (ASP) as well … read on

News of September 23, 2026

Hannes Straß and Pascal Kettmann win the Harold Boley Distinguished Paper Award

Learn more

International Center for Computational Logic

The International Center for Computational Logic (ICCL) is an interdisciplinary center of competence in research and teaching in the field of Computational Logic, with special emphasis on Algebra, Knowledge Representation, Logic, and Formal Methods in Computer Science. It has been founded at TU Dresden in October 2003. The following research groups are associated with ICCL:

Members and Guests

People at the International Center for Computational Logic

Newest Publications

Iosif Apostolakis, Hannes Straß, Johannes P. Wallner
Assumption-Based Argumentation Through the Lens of Approximation Fixpoint Theory
In Katie Atkinson, eds., Proceedings of the Eleventh International Conference on Computational Models of Argument (COMMA), 437–448, 2026. IOS Press
Details Download

Hannes Straß, Johannes P. Wallner
On the Complexity of Initial Models in Abstract Dialectical Frameworks
In Katie Atkinson, eds., Proceedings of the Eleventh International Conference on Computational Models of Argument (COMMA), 113–124, 2026. IOS Press
Details Download

Tim Lyon, Omar Taher
Optimizing Proof-Search via Linearization for Gödel-Löb Logic with Tree-Hypersequents
In Giorgio Bacci and Mickaël Randour, eds., Proceedings Seventeenth International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2026), volume 454, 148-164, 2026. Electronic Proceedings in Theoretical Computer Science
Details

Tim Lyon, Lukas Zenger
Non-Wellfounded and Cyclic Proofs for LTL: A Syntactic Correspondence with Linear Nested Sequents
In Giorgio Bacci and Mickaël Randour, eds., Proceedings Seventeenth International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2026), volume 454, 165-182, 2026. Electronic Proceedings in Theoretical Computer Science
Details

View full publication list