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.

Professors and Research Group Leaders

Management

Scientific Staff

Former Members

Shima5.jpg

Dr. Shima Asaadi

EB.19.jpg

Dipl.-Inf. Elisa Böhl

Martin-diller-2019.jpg

Dr. Martin Diller

TUD 8253 hi res 2.jpg

Dr. Sarah Alice Gaggl

DagmarFoto.png

Ass.-Prof. Dagmar Gromann

Thielscher.jpg

Prof. Michael Thielscher

Thomazo.JPG

Dr. Michaël Thomazo

Former Guests

Diana.JPG

Dr. Diana Troancă

Newest Publications

View full publication list

Xiaoyu Yin, Dagmar Gromann, Sebastian Rudolph
Neural Machine Translating from Natural Language to SPARQL
Future Generation Computer Systems, 117:510-519, 2021
Details Download

Sarah Alice Gaggl, Sebastian Rudolph, Hannes Strass
On the Decomposition of ADFs and the Complexity of Naive-based Semantics
Journal of Artificial Intelligence Research, 70:1-64, January 2021
Details Download

Bartosz Bednarczyk, Jakub Michaliszyn
"Most of" leads to undecidability: Failure of adding frequencies to LTL
Proceedings of the 24th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2021), to appear
Details

Bartosz Bednarczyk, Stéphane Demri, Alessio Mansutti
A Framework for Reasoning about Dynamic Axioms in Description Logics
Proceedings of the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence (IJCAI 2020), July 2020. International Joint Conferences on Artificial Intelligence
Details

Bartosz Bednarczyk, Piotr Ostropolski-Nalewaja, Robert Ferens
All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs
Proceedings of the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence (IJCAI 2020), July 2020. International Joint Conferences on Artificial Intelligence
Details

Bartosz Bednarczyk, Franz Baader, Sebastian Rudolph
Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints
Proceedings of the 24th European Conference on Artificial Intelligence (ECAI 2020), June 2020
Details

Aparna Saisree Thuluva, Darko Anicic, Sebastian Rudolph, Malintha Adikari
Semantic Node-RED for rapid development of interoperable industrial IoT applications
Semantic Web, 11(6):949-975, October 2020
Details Download

Norbert Manthey, Rafael Peñaloza Nyssen, Sebastian Rudolph
SATPin: Axiom Pinpointing for Lightweight Description Logics through Incremental SAT
Künstliche Intelligenz, 34(3):389-394, 2020
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), September 2020
Details

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

View full publication list

Courses


Suggested Thesis Topics


Completed Theses

DeciGUT-logo-final.png

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

Quantla-logo.png

QuantLA
Quantitative Logics and Automata

Wolpert-github.png

Wolpertinger
Wolpertinger is a fixed-domain reasoner