Automatentheorie
Aus International Center for Computational Logic
Automatentheorie
- Kontaktperson Franz Baader
- Sekretariat kerstin.achtruth@tu-dresden.de
Herr Prof. Dr.-Ing. Franz Baader wurde 2002 auf die Professur für Automatentheorie berufen. Seine Professur bietet grundlegende und vertiefende Lehrveranstaltungen für verschiedene Studiengänge an, und forscht auf den Gebieten Deduktion, Wissensrepräsentation, sowie Rechnen mit Molekülen.
Professoren und Gruppenleiter
Verwaltung
Wissenschaftliche Mitarbeiter
Techniker
- APB 3018
- +49 (0) 351 463-38422
Ehemalige
Dr.-Ing. Veronika Thost
- Ehemals Wissenschaftliche Mitarbeiterin
- Automatentheorie, Wissensbasierte Systeme
Ehemalige Gäste
Neueste Publikationen
Komplette Publikationsliste anzeigen
Filippo De Bortoli, Franz Baader
On the Abstract Expressive Power of Description Logics with Concrete Domains (Extended Version)
Technical Report, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, volume LTCS-Report 23-02, August 2023
Details
Stefan Borgwardt, Jörg Hoffmann, Alisa Kovtunova, Markus Krötzsch, Bernhard Nebel, Marcel Steinmetz
Expressivity of Planning with Horn Description Logic Ontologies (Extended Abstract)
In Ofer Arieli, Martin Homola,Jean Christoph Jung, Marie-Laure Mugnier, eds., Proceedings of the 35th International Workshop on Description Logics (DL 2022), volume 3263 of CEUR Workshop Proceedings, 2022. CEUR-WS.org
Details Download
Stefan Borgwardt, Jörg Hoffmann, Alisa Kovtunova, Markus Krötzsch, Bernhard Nebel, Marcel Steinmetz
Expressivity of Planning with Horn Description Logic Ontologies
Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI 2022), 5503--5511, 2022. AAAI Press
Details Download
Filippo De Bortoli, Franz Baader
Description Logics that Count, and What They Can and Cannot Count (Extended Abstract)
In Stefan Borgwardt, Thomas Meyer, eds., Proceedings of the 33rd International Workshop on Description Logics (DL'20), volume 2663 of CEUR Workshop Proceedings, 2020. CEUR-WS
Details
Filippo De Bortoli, Franz Baader
Description Logics That Count, and What They Can and Cannot Count
In Laura Kovacs, Konstantin Korovin, Giles Reger, eds., ANDREI-60. Automated New-era Deductive Reasoning Event in Iberia, volume 68 of EPiC Series in Computing, 1-25, 2020. EasyChair
Details
Filippo De Bortoli, Franz Baader
On the Expressive Power of Description Logics with Cardinality Constraints on Finite and Infinite Sets
In Andreas Herzig, Andrei Popescu, eds., Proc. of the 12th International Symposium on Frontiers of Combining Systems (FroCoS 2019), volume 11715 of Lecture Notes in Computer Science, 203-219, 2019. Springer
Details
Filippo De Bortoli
Integrating Reasoning Services for Description Logics with Cardinality Constraints with Numerical Optimization Techniques
Master's Thesis, April 2019
Details
Filippo De Bortoli, Franz Baader
On the Complexity and Expressiveness of Description Logics with Counting
Technical Report, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, volume LTCS-Report 19-09, December 2019
Details
Franz Baader, Bartosz Bednarczyk, Sebastian Rudolph
Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints
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 Download
David Carral, Larry González, Patrick Koopmann
From Horn-SRIQ to Datalog: A Data-Independent Transformation that Preserves Assertion Entailment
In Mantas Simkus, Grant E. Weddell, eds., Proceedings of the 32st International Workshop on Description Logics (DL 2019), volume 2373 of CEUR Workshop Proceedings, June 2019. CEUR-WS.org
Details Download
Lehrveranstaltungen
- Formale Systeme (WS 2022)
- Seminar Theoretical Computer Science (WS 2022)
- Proseminar "Perlen der theoretischen Informatik" (WS 2022)
- Proseminar Anwendungen der Logik in der Informatik (WS 2022)
- Projects Theoretical Computer Science (WS 2022)
weitere Lehrveranstaltungen anzeigen
Abgeschlossene Arbeiten
- Finite Herbrand Models for Monadic Clauses with Unary Function Symbols
- von Muhammad Zahid Zia (14 April 2016)
- Betreuer: Franz Baader, Stefan Borgwardt
- Iterative Ontology Update with Minimum Change
- von Aparna Saisree Thuluva (9 März 2015)
- Betreuer: Rafael Peñaloza Nyssen
