Computational Logic

Kontaktperson Sebastian Rudolph

Die Forschungsgruppe Computational Logic (CL) an der Fakultät Informatik der Technischen Universität Dresden befasst sich mit Modellierung und automatischem Schließen in der logikbasierten Wissensrepräsentation, einschließlich Fragen der Ausdrucksstärke, Entscheidbarkeit und Komplexität. Dabei gilt unser Interesse sowohl den mathematischen und formalen Grundlagen diverser Paradigmen der Wissensrepräsentation (z.B. Beschreibungslogiken, Answer Set Programming, Formale Begriffsanalyse) als auch deren Anwendungen in Gebieten wie dem Semantic Web, Wissensakquise, Argumentation, etc. Inspiriert durch diesen Gebieten entstammende Fragestellungen befassen wir uns auch mit Themen aus angrenzenden Forschungsfeldern wie beispielsweise Datenbanktheorie und Computerlinguistik.

Ehemals Doktorandin
Computational Logic

Dr. Dagmar Gromann

Ehemals Wissenschaftliche Mitarbeiterin
Computational Logic

Prof. Michael Thielscher

Ehemals Professor
Computational Logic

Dr. Michaël Thomazo

Ehemals Stipendiat
Computational Logic

Ehemalige Gäste

Dr. Diana Troancă

Ehemals Gastwissenschaftlerin
Computational Logic

Neueste Publikationen

Komplette Publikationsliste anzeigen

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
Details

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
Details

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
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), to appear. 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), to appear. 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), to appear
Details

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

Bartosz Bednarczyk
One-Variable Logic Meets Presburger Arithmetic
Theoretical Computer Science, 802(141-146), January 2020
Details

Shima Asaadi, Saif M. Mohammad, Svetlana Kiritchenko
Big BiRD: A Large, Fine-Grained, Bigram Relatedness Dataset for Examining Semantic Composition
Proceedings of the Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL), June 2019
Details Download

Komplette Publikationsliste anzeigen