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


Newest Publications

Lukas Gerlach
Chase Termination - Analytical Hierarchy, Disjunctions, Sufficient Conditions
Talk at Description Logics Seminar, April 2025
Details
David Carral, Lukas Gerlach, Lucas Larroque, Michaël Thomazo
Restricted Chase Termination: You Want More than Fairness
Proc. ACM Manag. Data, 3(2 (PODS)), to appear
Details Download
Bartosz Bednarczyk, Julien Grange
About the Expressive Power and Complexity of Order-Invariance with Two Variables
Logical Methods in Computer Science, 21(1):30:1--30:28, March 2025
Details Download
Lukas Gerlach
Formalizing Possibly Infinite Trees of Finite Degree
Talk at Workshop: Leaning In!, March 2025
Details
View full publication list