Computational Logic

From International Center for Computational Logic
Toggle side column

Computational Logic

The Computational Logic (CL) group at the Computer Science department of the Technische Universität Dresden is focusing on modeling and reasoning aspects of logic-based knowledge representation, including expressivity, decidability, and complexity analyses. We are interested both in the mathematical and formal foundations of diverse knowledge representation paradigms (including description logics, answer set programming, and formal concept analysis) but also in their applications to areas like the Semantic Web, knowledge acquisition, argumentation, etc. Motivated by requirements encountered in these fields, we also conduct research in adjacent areas like database theory and computational linguistics.

Newest Publications

View full publication list

Martin Diller, Atefeh Keshavarzi Zafarghandi, Thomas Linsbichler, Stefan Woltran
Investigating subclasses of abstract dialectical frameworks
Argument & Computation, 11(1-2):191-219, May 2020

Gerhard Brewka, Martin Diller, Georg Heissenberger, Thomas Linsbichler, Stefan Woltran
Solving Advanced Argumentation Problems with Answer Set Programming
Theory and Practice of Logic Programming, January 2020

Mei Yang, Sarah Alice Gaggl, Sebastian Rudolph
Neva – Extension Visualization for Argumentation Frameworks
Proceedings of the 8th International Conference on Computational Models of Argument (COMMA 2020), volume 326 of Frontiers in Artificial Intelligence and Applications, 477-478, September 2020
Details Download

Sarah Alice Gaggl, Matthias Thimm, Mauro Vallati
Proceedings of the Third International Workshop on Systems and Algorithms for Formal Argumentation (SAFA'20)
Volume 2672, September 2020.

Sarah Alice Gaggl, Thomas Linsbichler, Marco Maratea, Stefan Woltran
Design and results of the second international competition on computational models of argumentation
Artificial Intelligence, 279, February 2020
Details Download

Wolfgang Dvořák, Sarah Alice Gaggl, Anna Rapberger, Johannes Peter Wallner, Stefan Woltran
The ASPARTIX System Suite
Proceedings of the 8th International Conference on Computational Models of Argument (COMMA 2020), volume 326 of Frontiers in Artificial Intelligence and Applications, 461-462, September 2020
Details Download

Adam Richard-Bollans, Lucía Gómez Álvarez, Anthony Cohn
Modelling the Polysemy of Spatial Prepositions in Referring Expressions
Proceedings of the 17th International Conference on the Principles of Knowledge Representation and Reasoning (KR'20), to appear
Details Download

Bartosz Bednarczyk, Piotr Witkowski
A note on C2 interpreted over finite data-words
27th International Symposium on Temporal Representation and Reasoning (TIME 2020), to appear

Bartosz Bednarczyk, Stéphane Demri, Alessio Mansutti, Raul Fervari
Modal Logics with Composition on Finite Forests: Expressivity and Complexity
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2020), June 2020

Fariz Darari, Werner Nutt, Simon Razniewski, Sebastian Rudolph
Completeness and soundness guarantees for conjunctive SPARQL queries over RDF data sources with completeness statements
Semantic Web, 11(3):441-482, 2020

View full publication list


Suggested Thesis Topics

Completed Theses


A Grand Unified Theory of Decidability in Logic-Based Knowledge Representation


Quantitative Logics and Automata


Wolpertinger is a fixed-domain reasoner