International Center for Computational Logic

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche


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


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