M.Sc. Thomas Feller

Former member

Former Research Associate in Research Group Computational Logic

Newest Publications

Thomas Feller, Tim Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph
Decidability of Querying First-Order Theories via Countermodels of Finite Width
Logical Methods in Computer Science, 21(2):7:1-7:35, April 2025
Details Download

Thomas Feller, Tim Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph
Finite-Cliquewidth Sets of Existential Rules – Toward a General Criterion for Decidable yet Highly Expressive Querying
In Geerts, Floris and Vandevoort, Brecht, eds., Proceedings of the 26th International Conference on Database Theory (ICDT 2023), volume 255 of Leibniz International Proceedings in Informatics (LIPIcs), 18:1-18:18, March 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Details Download

Manuel Bodirsky, Thomas Feller, Simon Knäuer, Sebastian Rudolph
On Logics and Homomorphism Closure
Proceedings of the 36th Annual Symposium on Logic in Computer Science (LICS 2021), 1-13, 2021. IEEE
Details Download

Frederic Dörband, Thomas Feller, Kevin Stier
Sequentiality of Group-Weighted Tree Automata
In Alberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron, eds., Language and Automata Theory and Applications. LATA 2021., volume 12638 of Lecture Notes in Computer Science, 267-278, February 2021. Springer
Details Download

Frederic Dörband, Thomas Feller, Kevin Stier
Approximated Determinisation of Weighted Tree Automata
In Alberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron, eds., Language and Automata Theory and Applications. LATA 2021., volume 12638 of Lecture Notes in Computer Science, 255-266, February 2021. Springer
Details Download

Thomas Feller, Christian Pech, Maja Pech
The classification of homomorphism homogeneous tournaments
European Journal of Combinatorics, 89:103142, October 2020
Details Download

View full publication list

Courses

Research Seminar Logic and AI (SS 2021)
Research Seminar Logic and AI (WS 2020)

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