Computational Logic
Computational Logic
- Contact Sebastian Rudolph
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
Prof. Sebastian Rudolph
- sebastian.rudolph@tu-dresden.de
- +49 351 463 38516
- APB 2035
- Computational Logic
Management
Dipl.-Ing. Ramona Behling
- ramona.behling@tu-dresden.de
- +49 351 463 38516
- APB 2048
- Computational Logic
Scientific Staff
M.Sc. Shima Asaadi
- firstname.lastname@tu-dresden.de
- +49 351 463 43560
- APB 2036
- Computational Logic
Bartosz Bednarczyk
- bartosz.bednarczyk@tu-dresden.de
- +49 351 463 42665
- APB 2031
- Computational Logic
Dipl.-Inf. Elisa Böhl
- elisa.boehl@tu-dresden.de
- +49 351 463 42666
- APB 2031
- Computational Logic
M.Sc. Thomas Feller
- firstname.lastname@tu-dresden.de
- +49 351 463 42665
- APB 2031
- Computational Logic
- sarah.gaggl@tu-dresden.de
- +49 351 463 38679
- APB 2034
- Computational Logic
M.Sc. Lukas Schweizer
- firstname.lastname@tu-dresden.de
- +49 351 463 43559
- APB 2033
- Computational Logic
Former Members
Dr. Dagmar Gromann
- Former Research Associate
- Computational Logic
Prof. Michael Thielscher
- Former Professor
- Computational Logic
Dr. Michaël Thomazo
- Former Scholarship Holder
- Computational Logic
Former Guests
Dr. Diana Troancă
- Former Visiting Scientist
- Computational Logic
Newest Publications
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
Bartosz Bednarczyk, Franz Baader, Sebastian Rudolph
Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints
Technical Report, Computational Logic Group, 2019
Details Download
Bartosz Bednarczyk, Emanuel Kieroński, Piotr Witkowski
On the Complexity of Graded Modal Logics with Converse.
In Francesco Calimeri, Nicola Leone, Marco Manna, eds., JELIA 2019, Logics in Artificial Intelligence - 16th European Conference, volume 11468 of LNCS, May 2019. Springer
Details
Bartosz Bednarczyk, Sebastian Rudolph
Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting
In Mantas Simkus, Grant E. Weddell, eds., Proceedings of the 32nd International Workshop on Description Logics, volume 2373 of CEUR Workshop Proceedings, June 2019. CEUR-WS.org
Details
Bartosz Bednarczyk, Sebastian Rudolph
Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting
Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI'19), August 2019. International Joint Conferences on Artificial Intelligence
Details
Bartosz Bednarczyk, Sebastian Rudolph, Franz Baader
Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints
In Mantas Simkus, Grant E. Weddell, eds., Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints, volume 2373 of CEUR Workshop Proceedings, June 2019. CEUR-WS.org
Details
Bartosz Bednarczyk, Stéphane Demri
Why propositional quantification makes modal logics on trees robustly hard ?
LICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 1--13, June 2019. IEEE
Details
Bernhard Ganter, Sebastian Rudolph, Gerd Stumme
Explaining Data with Formal Concept Analysis
In Markus Krötzsch, Daria Stepanova, eds., Reasoning Web. Explainable Artificial Intelligence - 15th International Summer School 2019, Bolzano, Italy, September 20-24, 2019, Tutorial Lectures., volume 11810 of LNCS, 153-195, 2019. Springer
Details Download
Courses
- Academic Skills in Computer Science (SS 2020)
- Seminar Selected Topics of Computational Logic (WS 2019)
- Foundations of Constraint Programming (WS 2019)
- Foundations of Logic Programming (WS 2019)
- Introduction to Formal Concept Analysis (WS 2019)
show further courses
Suggested Thesis Topics
- Implementing the Decomposition Schema for Abstract Dialectical Frameworks
- Supervisor: Sarah Alice Gaggl
- Available as topic for a project thesis
- Meta-Modelling in Formal Concept Analysis
- Supervisor: Sebastian Rudolph
- Available as topic for a Bachelor's thesis, project thesis
Completed Theses
- Justifications under the Fixed-Domain Semantics
- by Satyadharma Tirtarasa (28 September 2017)
- Supervisor: Sebastian Rudolph, Lukas Schweizer
- Using (Deep) Reinforcement Learning To Play Angry Birds
- by Peter Hirsch (26 September 2017)
- Supervisor: Lukas Schweizer
- Solving Angry Birds with Reinforcement Learning
- by Richard Kwasnicki (23 Februar 2017)
- Supervisor: Sarah Alice Gaggl, Lukas Schweizer
- Solving Angry Birds with Reinforcement Learning
- by Julius Gonsior (23 Februar 2017)
- Supervisor: Sarah Alice Gaggl, Lukas Schweizer
- Visualization of Solutions in Abstract Argumentation Frameworks
- by Rajwardhan Kumar (27 Oktober 2016)
- Supervisor: Sarah Alice Gaggl
- Encoding Belief Revision Operators in Abstract Dialectical Frameworks
- by Umer Mushtaq (7 Oktober 2016)
- Supervisor: Sebastian Rudolph, Sarah Alice Gaggl
- On the Computation of Naive-based Argumentation Semantics
- by Javanshir Alammadli (14 März 2016)
- Supervisor: Sebastian Rudolph, Sarah Alice Gaggl
- Navigation Approaches for Answer Sets
- by Asmaa Afeefi (4 Dezember 2015)
- Supervisor: Sarah Alice Gaggl, Sebastian Rudloph
- Intertranslatability of Labeling-Based Argumentation Semantics
- by Umer Mushtaq (19 November 2015)
- Supervisor: Sarah Alice Gaggl
- Implementing a Labeling-based Algorithm for the cf2 Argumentation Semantics
- by Javanshir Alammadli (20 April 2015)
- Supervisor: Sarah Alice Gaggl
- Grounded Circumscription in Description Logics
- by Efstathios Delivorias (9 April 2015)
- Supervisor: Sebastian Rudolph
- Solving Product Configuration Problems using Non-standard Reasoning Services
- by Lukas Schweizer (11 Juli 2014)
- Supervisor: Sebastian Rudolph, Sarah Alice Gaggl
CPEC
Center for Perspicuous Computing
DeciGUT
A Grand Unified Theory of Decidability in Logic-Based Knowledge Representation
QuantLA
Quantitative Logics and Automata
Wolpertinger
Wolpertinger is a fixed-domain reasoner
