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


Newest Publications

Tim Lyon, Piotr Ostropolski-Nalewaja
Foundations for an Abstract Proof Theory in the Context of Horn Rules
ACM Transactions on Computational Logic, 27(4), October 2026
Details
Christel Baier, Sascha Klüppelholz, Timm Spork
Probabilistic Model Checking via Families of Deterministic and Unambiguous Finite Automata
In Ana Sokolova, Patrick Totzke, eds., 37th International Conference on Concurrency Theory (CONCUR 2026), volume 391 of Leibniz International Proceedings in Informatics (LIPIcs), 15:1 - 15:19, August 2026. Schloss Dagstuhl- Leibniz-Zentrum für Informatik
Details Download
Sebastian Rudolph
Pseudo-Closed Family Verification is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem)
In Madalina Croitoru, Domingo López-Rodríguez, Gerd Stumme, eds., The Third International Joint Conference on Conceptual Knowledge Structures (CONCEPTS 2026), volume 16811 of LNCS, 3-19, 2026. Springer
Details Download
View full publication list