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, Logic, and Formal Methods in Computer Science. It has been founded at TU Dresden in October 2003.

This is the new website of ICCL, first published in October 2014. Some previous content has not been moved yet and can be found under The following research groups are already present here on the new site:

Members and Guests

Portrait Sebastian RudolphPortrait Maximilian MarxPortrait Sascha KlüppelholzPortrait Markus KrötzschPortrait Bartosz BednarczykPortrait Faiq Miftakhul FalakhPortrait Christel BaierPortrait Ilja ShmelkinPortrait Satyadharma TirtarasaPortrait Tobias PhilippPortrait Sarah Alice GagglPortrait Kati MichelPortrait Lukas SchweizerPortrait Steffen HölldoblerPortrait Johannes FichtePortrait Christoph WernhardPortrait Christian LewePortrait Shima AsaadiPortrait Larry GonzálezPortrait Stefan BorgwardtPortrait Emmanuelle DietzPortrait Franz BaaderPortrait Manuel BodirskyPortrait Sylvia WünschPortrait Anni-Yasmin TurhanPortrait Andreas EckePortrait Patrick KoopmannPortrait Alexander KrausePortrait Ramona BehlingPortrait Sandy SeifarthPortrait Thomas FellerPortrait Adrian BielefeldtPortrait Irina DragostePortrait David CarralPortrait Kerstin Achtruth

People at the International Center for Computational Logic

Newest Publications

Shima Asaadi, Saif M. Mohammad, Svetlana Kiritchenko
Big BiRD: A Large, Fine-Grained, Bigram Relatedness Dataset for Examining Semantic Composition
Proceedings of the Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL), to appear

Bartosz Bednarczyk, Emanuel Kieroński, Piotr Witkowski
On the Complexity of Graded Modal Logics with Converse.
JELIA 2019, to appear

Bartosz Bednarczyk, Stéphane Demri
Why propositional quantification makes modal logics on trees robustly hard ?
LICS 2019, to appear

View full publication list