International Center for Computational Logic
Dresden's new home for knowledge technologies and logic in computer science.
Our groups
Research groups introduced:
Computational Logic
Sebastian Rudolph
News of September 23, 2026
Hannes Straß and Pascal Kettmann win the Harold Boley Distinguished Paper Award
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
Recovering Explanations from Transformed Rule-Based Ontologies
In Manolis Koubarakis, Maria-Esther Vidal, Axel Polleres, Marieke van Erp, Ernesto Jimenez Ruiz, Oshani Seneviratne, Lora Aroyo, Gianluca Demartini, Reham Alharbi, Roberto Barile, Claudia d'Amato, And Valentina Tamma, eds., Proceedings of the 25th International Semantic Web Conference (ISWC 2026), volume 17127 of LNCS, 197-217, 2026. Springer
Details Download
Stratified Negation in RDF Rules: A Correct Approach
In Manolis Koubarakis, Maria-Esther Vidal, Axel Polleres, Marieke van Erp, Ernesto Jimenez Ruiz, Oshani Seneviratne, Lora Aroyo, Gianluca Demartini, Reham Alharbi, Roberto Barile, Claudia d'Amato, Valentina Tamma, eds., Proceedings of the 25th International Semantic Web Conference (ISWC 2026), volume 17127 of LNCS, 157–175, 2026. Springer
Details Download
Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory
The 10th International Joint Conference on Rules and Reasoning (RuleML+RR 2026), LNCS, to appear. Springer
Details Download
Assumption-Based Argumentation Through the Lens of Approximation Fixpoint Theory
In Katie Atkinson, eds., Proceedings of the Eleventh International Conference on Computational Models of Argument (COMMA), 437–448, 2026. IOS Press
Details Download
NEWS
September 23, 2026Hannes Straß and Pascal Kettmann win the Harold Boley Distinguished Paper Award
July 9, 2026Course on Standpoint Logic at ESSAI 2026 by Tim Lyon and Hannes Straß
July 7, 2026Jonas Karge Successfully Defends PhD Thesis on Multi-Agent Belief Management
July 2, 2026Hannes Straß Receives Student Council Teaching Award for "Algorithmic Game Theory"
March 27, 2026Franz Baader wins Best Paper Award at FoIKS 2026
... further resultsEVENTS
November 26, 2026Talk: Rewrite Once, Validate Anywhere: Producing OWL-Aware SHACL Constraints
December 3, 2026Talk: Survey of Syntax Splitting
December 10, 2026Talk: On the Complexity of Model Checking for Temporal Equilibrium Logic
January 7, 2027Talk: Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory
January 21, 2027Talk: Smallest Synchronizing Terms over Constant Alphabets Can Be Exponentially High
... further resultsOur Projects
Our Partners
