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


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 (RuleML+RR 2026), LNCS, to appear. Springer
Details Download
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