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:
- Algebra and Discrete Structures
- Algebraic and Logical Foundations of Computer Science
- Automata Theory
- Computational Logic
- Knowledge-aware Artificial Intelligence
- Logic Programming and Argumentation
- Knowledge-Based Systems
Members and Guests
Newest Publications
Lukas Gerlach
The Chase in Lean - Crafting a Formal Library for Existential Rule Research
In Renata Wassermann, Marie-Laure Mugnier, Franz Baader, eds., Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning, volume 23 of Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning, to appear
Details Download
Raimund Dachselt, Lukas Gerlach, Philipp Hanisch, Alex Ivliev, Markus Krötzsch, Maximilian Marx, Julián Méndez
Nemo at v0.10: Explainable Web Rule Reasoning for RDF, SPARQL, and More
In Maribel Acosta, Marieke van Erp, Sebastian Rudolph, Olaf Hartig, Blerina Spahiu, Anisa Rula, Daniel Garijo, Francesco Osborne, eds., Supplementary Proceedings of the 23rd European Semantic Web Conference (ESWC 2026), LNCS, to appear. Springer
Details Download
Raimund Dachselt, Lukas Gerlach, Philipp Hanisch, Alex Ivliev, Markus Krötzsch, Maximilian Marx, Julián Méndez
Declarative Debugging for Datalog with Aggregation
In Alexander Krause, João Felipe Pimentel, eds., Proceedings of the Workshops of the EDBT/ICDT 2026 Joint Conference (EDBT/ICDT-WS 2026), Tampere, Finland, March 24, 2026, volume 4192 of CEUR Workshop Proceedings, 2026. CEUR-WS.org
Details Download
Sergei Obiedkov, Barış Sertkaya
AFCA: Searching for Complete Extensions via Enumeration of a Closure System
In Iosif Apostolakis, Andrei Popesci, Johannes P. Wallner, eds., Solver and Benchmark Descriptions of ICCMA 2025: Sixth International Competition on Computational Models of Argumentation, 11–12, 2026
Details Download
NEWS
March 27, 2026Franz Baader wins Best Paper Award at FoIKS 2026
January 13, 2026Tim Lyon has joined the editorial board of the Bulletin of the Section of Logic
November 27, 2025Best demo award for GPTKB at ISWC
October 23, 2025Dörthe Arndt wins Rule Challenge Best Paper Award at RuleML+RR 2025
September 30, 2025Filippo De Bortoli wins Best Student Paper Award at FroCoS 2025
... further results
