Jakub Rydval

I am a postdoctoral researcher; currently working in the Algebra Group at TU Wien,

employed on FWF project ESP1571225.

I obtained my PhD in 2022 at TU Dresden under the supervision of Franz Baader and Manuel Bodirsky (Grade: Summa)
My research interests lie mainly in mathematical logic and constraint satisfaction problems (CSPs); CV: link
When not working on CSPs, you can usually find me bouldering or mountain-biking

Teaching

A course on finite model theory at TU WIEN (link), Sommersemester 2025, TU Wien; lecture notes are available here: link
Exercises Algebra 2, Wintersemester 2023/24, TU Wien

Exercises Algebra 1, Sommersemester 2023, TU Wien

Supervision

Master's Thesis supervision: Paul Winkler, “On the Descriptive Complexity of Phylogeny Constraint Satisfaction Problems”, TU Wien, 2024

Preprints

Santiago Guzmán-Pro. The Polynomial Hierarchy and ω-categorical CSPs. arXiv preprint:2604.24539
Alexey Barsukov, Michael Pinsker, and Jakub Rydval. The Golden Path to Guarded Monotone Strict NP. arXiv preprint: 2310.01254
Michael Pinsker, Jakub Rydval, Moritz Schöbi, Christoph Spiess, and Paul Winkler. Three Fundamental Questions in Infinite-domain Constraint Satisfaction. arXiv preprint: 2502.06621

Publications

Michael Pinsker, Jakub Rydval, Moritz Schöbi, and Christoph Spiess. Three Fundamental Questions in Modern Infinite-domain Constraint Satisfaction. Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science (MFCS). 2025
Jakub Rydval. Finitely Bounded Homogeneity Turned Inside-Out. Journal of Mathematical Logic. 2025
Alexey Barsukov, Michael Pinsker, and Jakub Rydval. Containment for Guarded Monotone Strict NP. Proceedings of the 52nd EATCS International Colloquium on Automata, Languages and Programming (ICALP). 2025
Jakub Rydval, Žaneta Semanišinová, and Michał Wrona. Identifying Tractable Quantified Temporal Constraints within Ord-Horn, Proceedings of the 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP). 2024
Jakub Rydval, Homogeneity and Homogenizability: Hard Problems for the Logic SNP, Proceedings of the 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP). 2024
Manuel Bodirsky and Jakub Rydval. On the Descriptive Complexity of Temporal Constraint Satisfaction Problems. Journal of the ACM (JACM). 2023
Manuel Bodirsky, Johannes Greiner, and Jakub Rydval. Tractable Combinations of Temporal CSPs. Logical Methods in Computer Science (LMCS). 2022
Franz Baader and Jakub Rydval. Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains. Journal of Automated Reasoning (JAR). 2022
Manuel Bodirsky, Jakub Rydval, and André Schrottenloher. Universal Horn Sentences and the Joint Embedding Property. Discrete Mathematics & Theoretical Computer Science (DMTCS). 2022
Franz Baader and Jakub Rydval. An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics. Proceedings of the 17th European Conference on Logics in Artificial Intelligence (JELIA). 2021
Manuel Bodirsky, Wied Pakusa, and Jakub Rydval. Temporal constraint satisfaction problems in fixed-point logic. Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). 2020
Franz Baader and Jakub Rydval. Description Logics with Concrete Domains and General Concept Inclusions Revisited (Extended Abstract). Proceedings of the 33rd International Workshop on Description Logics (DL). 2020
Franz Baader and Jakub Rydval. Description Logics with Concrete Domains and General Concept Inclusions Revisited. Proceedings of the 10th International Joint Conference on Automated Reasoning (IJCAR). 2020

Future events

CSP World Congress VIII, 13-19.9.2026, Livigno, Italy

Past events

BLAST 2026, 18–21.05.2026, Waco, Texas, presentation: “Containment for Guarded Monotone Strict NP”
Panglobal Algebra and Logic Seminar (PALS), 21.04.2026, Boulder, Colorado, online presentation: “The Polynomial Hierarchy and ω-categorical CSPs”
Durham Symposium 117 – Mathematics of Constraint Satisfaction, 13–17.04.2026, Durham, UK, presentation: “The Polynomial Hierarchy and ω-categorical CSPs”
108th Workshop on General Algebra (AAA108), 6–8.2.2026, Vienna, attending
Seminar Algebra–Geometrie–Kombinatorik, 29.1.2026, Dresden, presentation: “Containment for Guarded Monotone Strict NP”
Homogeneous Structures: Model Theory meets Universal Algebra, 14.12–19.12.2025, Oberwolfach, Germany, presentation: “Finitely-Bounded Homogeneity Turned Inside-Out”
CSP World Congress VII, 21-27.9.2025, Cervinia, Italy, attending
52nd EATCS International Colloquium on Automata, Languages and Programming (ICALP), 8–11.7.2025, Aarhus, Denmark, attending
Infinite CSP Research Retreat, 7–14.6.2025, Marciana, Italy, attending
The Constraint Satisfaction Problem: Complexity and Approximability, 18–23.5.2025, Dagstuhl, Germany, presentation: "Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction"
Seminar on Foundations of Computing, 31.3.2025, Brno, presentation: “Constraint satisfaction problems with infinite domains”
CSP World Congress VI, 23–27.9.2024, Colfosco, presentation: “Finitely-Bounded Homogeneity Turned Inside-Out”
51st EATCS International Colloquium on Automata, Languages and Programming (ICALP), 8–12.7.2024, Tallinn, presentation: “Homogeneity and Homogenizability: Hard Problems for the Logic SNP”
1st Birmingham CSP meeting (BCM2024), 7–8.5.2024, Birmingham, presentation: "A survey of the infinite-domain CSP"
CSP World Congress V, 18–22.9.2023, Weissensee, attending
103rd Workshop on General Algebra (AAA103), 9–11.6.2023, Tartu, presentation: "Hard meta problems at the core of the infinite-domain CSP dichotomy conjecture"
The FG1 Seminar, 25.11.2022, Vienna, presentation: “A long-standing meta problem at the core of the infinite-domain CSP dichotomy conjecture”
CSP World Congress IV, 18–24.9.2022, Molveno, Italy, attending
The Constraint Satisfaction Problem: Complexity and Approximability, 15–20.5.2022, Dagstuhl, attending
International Seminar, 22.10.2021, Dresden, presentation: “On hardness of deciding the JEP and the AP for universal sentences”
QuantLA Workshop, 6–8.10.2021, Dresden, presentation online: “Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains”
CSP World Congress III, 26.9.2021–2.10.2021, Kranjska Gora, presentation: “On hardness of deciding the JEP and the AP for universal sentences”
Research Seminar Logic and AI, 24.6.2021, Dresden, presentation online: “Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains”
101st Workshop on General Algebra (AAA101), 4–6.6.2021, Novi Sad, attending online
17th Edition of the European Conference on Logics in Artificial Intelligence (JELIA 2021), 17–20.5.2021, Klagenfurt, presentation online: “An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics”
100th Workshop on General Algebra (AAA100), 5–7.2.2021, Kraków, attending online
QuantLA Workshop, 5–7.10.2020, Dresden, presentation online: “Algebraic characterisations of p-admissibility”
CSP World Congress II, 20–26.9.2020, Völs am Schlern, attending
33rd International Workshop on Description Logics (DL 2020), 12–14.9.2020, Rhodes, presentation online: “Description logics with concrete domains and general concept inclusions revisited”
35th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2020), 8–11.7.2020, Saarbrücken, presentation online: “Temporal constraint satisfaction problems in least fixed-point logic,” Best Video Award
10th International Joint Conference on Automated Reasoning (IJCAR 2020), 29.6.2020–6.7.2020, Paris, presentation online: “Description logics with concrete domains and general concept inclusions revisited”
99th Workshop on General Algebra (AAA99), 21–23.2.2020, Sienna, presentation: “Description logics with concrete domains and general concept inclusions revisited”
QuantLA Research Seminar, 19.11.2019, Dresden, presentation: “Temporal constraint satisfaction problems in least fixed-point logic”
Workshop Logic in Computer Science, 21–22.10.2019, Jena, presentation: “Temporal constraint satisfaction problems in least fixed-point logic”
QuantLA Workshop, 7–11.10.2019, Stolpen, presentation: “User-Definable Concrete Domains”
QuantLA Research Seminar, 2.7.2019, Dresden, presentation: “User-Definable Concrete Domains”
98th Workshop on General Algebra (AAA98), 21–23.6.2019, Dresden, attending
QuantLA Spring school, 25–29.3.2019, Krippen, attending
97th Workshop on General Algebra (AAA97), 1–3.3.2019, Vienna, presentation: “Temporal constraint satisfaction problems in least fixed-point logic”
Seminar KAFKA, 17.10.2018, Prague, presentation: “Temporal constraint satisfaction problems in least fixed-point logic”
96th Workshop on General Algebra (AAA96), 1–3.6.2018, Darmstadt, attending