International Center for Computational Logic

From International Center for Computational Logic


International Center for Computational Logic

EbD-rightmargin.png

                  

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 Jakob PiribauerPortrait Piotr Ostropolski-NalewajaPortrait Ramona BehlingPortrait Filippo De BortoliPortrait Karina AdlerPortrait Patrick WienhöftPortrait Philipp HanischPortrait Christel BaierPortrait Elisa BöhlPortrait Maximilian MarxPortrait Sandy SeifarthPortrait Manuel BodirskyPortrait Robin ZiemekPortrait Piotr GorczycaPortrait Stefan BorgwardtPortrait Jonas KargePortrait Calvin ChauPortrait Johannes LehmannPortrait Pascal KettmannPortrait Markus KrötzschPortrait Andrea KühnPortrait Meghna BhadraPortrait Matthias MeißnerPortrait Sebastian RudolphPortrait Martin DillerPortrait Simon RazniewskiPortrait Tim LyonPortrait Alex IvlievPortrait Sergei ObiedkovPortrait Max KornPortrait Rajab AghamovPortrait Hannes StraßPortrait Knut BerlingPortrait Kerstin AchtruthPortrait Kati DomannPortrait Lukas GerlachPortrait Sarah Alice GagglPortrait Timm SporkPortrait Luisa HerrmannPortrait Larry GonzálezPortrait Nikolai KäferPortrait Sascha KlüppelholzPortrait Franz BaaderPortrait Dörthe ArndtPortrait Stephan Mennicke


Newest Publications

Jonas Karge
When Diversity in Voting Trumps Ability
Episteme, to appear
Details
Tobias Meggendorfer, Maximilian Weininger, Patrick Wienhöft
Solving Robust Markov Decision Processes: Generic, Reliable, Efficient
In Toby Walsh, Julie Shah, Zico Kolter, eds., Proceedings of the 39th Annual AAAI Conference on Artificial Intelligence, volume 39 of 25, 26631-26641, April 2025. AAAI Press
Details Download
Lukas Gerlach
Formalizing Possibly Infinite Trees of Finite Degree
Talk at Workshop: Leaning In!, March 2025
Details
Thomas Feller, Tim Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph
Decidability of Querying First-Order Theories via Countermodels of Finite Width
Logical Methods in Computer Science, 21(2):7:1-7:35, April 2025
Details Download
View full publication list