International Center for Computational Logic

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


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


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