International Center for Computational Logic

From International Center for Computational Logic


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

Portrait Matthias MeißnerPortrait Dörthe ArndtPortrait Maximilian MarxPortrait Christel BaierPortrait Sandy SeifarthPortrait Sergei ObiedkovPortrait Stephan MennickePortrait Hannes StraßPortrait Timm SporkPortrait Simon RazniewskiPortrait Johannes LehmannPortrait Jonas KargePortrait Elisa BöhlPortrait Andrea KühnPortrait Alex IvlievPortrait Sebastian RudolphPortrait Nikolai KäferPortrait Calvin ChauPortrait Christina NorkusPortrait Luisa HerrmannPortrait Rajab AghamovPortrait Nils KüchenmeisterPortrait Kati DomannPortrait Piotr GorczycaPortrait Sarah Alice GagglPortrait Pascal KettmannPortrait Lukas GerlachPortrait Karina NeupertPortrait Philipp HanischPortrait Meghna BhadraPortrait Tom FriesePortrait Max KornPortrait Franz BaaderPortrait Martin DillerPortrait Filippo De BortoliPortrait Manuel BodirskyPortrait Sascha KlüppelholzPortrait Kerstin AchtruthPortrait Jakob PiribauerPortrait Ramona BehlingPortrait Markus KrötzschPortrait Stefan BorgwardtPortrait Tim Lyon


Newest Publications

Pascal Kettmann, Hannes Straß, Jesse Heyninck, Jeroen Spaans
Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory
The 10th International Joint Conference on Rules and Reasoning, to appear
Details
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
View full publication list