International Center for Computational Logic

From International Center for Computational Logic


International Center for Computational Logic

...explainability by design

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


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