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
Non-Wellfounded and Cyclic Proofs for LTL: A Syntactic Correspondence with Linear Nested Sequents
Technical Report, TU Dresden, 2026
Details Download
Foundations for an Abstract Proof Theory in the Context of Horn Rules
ACM Transactions on Computational Logic, 27(4), October 2026
Details
Probabilistic Model Checking via Families of Deterministic and Unambiguous Finite Automata
In Ana Sokolova, Patrick Totzke, eds., 37th International Conference on Concurrency Theory (CONCUR 2026), volume 391 of Leibniz International Proceedings in Informatics (LIPIcs), 15:1 - 15:19, August 2026. Schloss Dagstuhl- Leibniz-Zentrum für Informatik
Details Download
Pseudo-Closed Family Verification is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem)
In Madalina Croitoru, Domingo López-Rodríguez, Gerd Stumme, eds., The Third International Joint Conference on Conceptual Knowledge Structures (CONCEPTS 2026), volume 16811 of LNCS, 3-19, 2026. Springer
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
October 8, 2026October 15, 2026Talk: Towards Finite Satisfiability Problem for Propositional Dynamic Logic with Loops
October 22, 2026Talk: Recovering Explanations from Transformed Rule-Based Ontologies
October 22, 2026
