International Center for Computational Logic

From International Center for Computational Logic


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 Piotr GorczycaPortrait Franz BaaderPortrait Sascha KlüppelholzPortrait Karina AdlerPortrait Matthias MeißnerPortrait Meghna BhadraPortrait Elisa BöhlPortrait Piotr Ostropolski-NalewajaPortrait Stefan BorgwardtPortrait Larry GonzálezPortrait Philipp HanischPortrait Knut BerlingPortrait Rajab AghamovPortrait Simon RazniewskiPortrait Manuel BodirskyPortrait Maximilian MarxPortrait Alex IvlievPortrait Sarah Alice GagglPortrait Ramona BehlingPortrait Filippo De BortoliPortrait Sandy SeifarthPortrait Sergei ObiedkovPortrait Stephan MennickePortrait Jonas KargePortrait Sebastian RudolphPortrait Markus KrötzschPortrait Kati DomannPortrait Pascal KettmannPortrait Tim LyonPortrait Hannes StraßPortrait Christel BaierPortrait Kerstin AchtruthPortrait Dörthe ArndtPortrait Luisa HerrmannPortrait Martin DillerPortrait Lukas Gerlach


Newest Publications

Tim Lyon
On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic
Proceedings of the Eleventh International Conference on Fundamentals of Software Engineering (FSEN), LNCS, to appear. Springer
Details
Tim Lyon
Unifying Sequent Systems for Gödel-Löb Provability Logic via Syntactic Transformations
In Jörg Endrullis, Sylvain Schmitz, eds., Proceedings of the 33rd EACSL Annual Conference on Computer Science Logic 2025, volume 326 of LIPIcs, to appear. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Details
Tim Lyon, Ian Shillito, Alwen Tiu
Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents
In Jörg Endrullis, Sylvain Schmitz, eds., Proceedings of the 33rd EACSL Annual Conference on Computer Science Logic 2025, volume 326 of LIPIcs, to appear. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Details
Lukas Gerlach, David Carral, Markus Hecher
Finite Groundings for ASP with Functions: A Journey through Consistency (Extended Abstract)
In Nina Gierasimczuk, Jesse Heyninck, eds., Proceedings of the 22nd International Workshop on Nonmonotonic Reasoning (NMR 2024), volume 3835 of CEUR Workshop Proceedings, 183-186, November 2024. CEUR-WS.org
Details Download
View full publication list