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 Kati DomannPortrait Piotr GorczycaPortrait Tim LyonPortrait Hannes StraßPortrait Larry GonzálezPortrait Piotr Ostropolski-NalewajaPortrait Elisa BöhlPortrait Ramona BehlingPortrait Stefan BorgwardtPortrait Dominik RusovacPortrait Simon KnäuerPortrait Faiq Miftakhul FalakhPortrait Dörthe ArndtPortrait Jonas KargePortrait Patrick KoopmannPortrait Anni-Yasmin TurhanPortrait Stefan EllmauthalerPortrait Manuel BodirskyPortrait Martin DillerPortrait Maximilian MarxPortrait Karina AdlerPortrait Christel BaierPortrait Alex IvlievPortrait Kerstin AchtruthPortrait Sebastian RudolphPortrait Bartosz BednarczykPortrait Franz BaaderPortrait Sascha KlüppelholzPortrait Luisa HerrmannPortrait Lucía Gómez ÁlvarezPortrait Sandy SeifarthPortrait Thomas FellerPortrait Irina DragostePortrait Ali ElhalawatiPortrait Sarah Alice GagglPortrait Satyadharma TirtarasaPortrait Stephan MennickePortrait Lukas GerlachPortrait Markus Krötzsch

Newest Publications

Sarah Alice Gaggl, Philipp Hanisch, Markus Krötzsch
Simulating Sets in Answer Set Programming
In Luc De Raedt, eds., Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI 2022), 2634--2640, 2022.
Details Download
Johannes Klaus Fichte, Sarah Alice Gaggl, Dominik Rusovac
Rushing and Strolling among Answer Sets – Navigation Made Easy (Extended Abstract)
In Yuliya Lierler, Jose F. Morales, Carmine Dodaro, Veronica Dahl, Martin Gebser, Tuncay Tekle, eds., Technical Communication Proceeding of the 38th International Conference on Logic Programming (ICLP 2022), volume 364 of EPTCS, 181-184, to appear. Open Publishing Association
Bartosz Bednarczyk, Stéphane Demri
Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard?
Logical Methods in Computer Science, Volume 18, Issue 3(5), July 2022
Stefan Ellmauthaler, Sarah Alice Gaggl, Dominik Rusovac, Johannes P. Wallner
Representing Abstract Dialectical Frameworks with Binary Decision Diagrams
Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022), to appear
Details Download
View full publication list