Description Logics with Concrete Domains and General Concept Inclusions Revisited. - Franz Baader; Jakub Rydval (IJCAR (1), 2020)

Description Logics with Concrete Domains and General Concept Inclusions Revisited (Extended Abstract). - Franz Baader; Jakub Rydval (Description Logics, 2020)

Temporal Constraint Satisfaction Problems in Fixed-Point Logic. - Manuel Bodirsky; Wied Pakusa; Jakub Rydval (LICS, 2020)

An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics. - Franz Baader; Jakub Rydval (JELIA, 2021)

Amalgamation is Undecidable. - Manuel Bodirsky; Simon Knäuer; Jakub Rydval (CoRR, 2021)

Universal Horn Sentences and the Joint Embedding Property. - Manuel Bodirsky; Jakub Rydval; André Schrottenloher (Discret. Math. Theor. Comput. Sci., 2021)

Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains. - Franz Baader; Jakub Rydval (J. Autom. Reason., 2022)

Tractable Combinations of Temporal CSPs. - Manuel Bodirsky; Johannes Greiner; Jakub Rydval (Log. Methods Comput. Sci., 2022)

Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains. - Jakub Rydval (2022)

On the Descriptive Complexity of Temporal Constraint Satisfaction Problems. - Manuel Bodirsky; Jakub Rydval (J. ACM, 2023)

Homogeneity and Homogenizability: Hard Problems for the Logic SNP. - Jakub Rydval (ICALP, 2024)

Identifying Tractable Quantified Temporal Constraints Within Ord-Horn. - Jakub Rydval; Zaneta Semanisinová; Michal Wrona (ICALP, 2024)

Containment for Guarded Monotone Strict NP. - Alexey Barsukov; Michael Pinsker; Jakub Rydval (ICALP, 2025)

Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction. - Michael Pinsker; Jakub Rydval; Moritz Schöbi; Christoph Spiess (MFCS, 2025)

Three meta-questions on infinite-domain Constraint Satisfaction Problems. - Michael Pinsker; Jakub Rydval; Moritz Schöbi; Christoph Spiess (CoRR, 2025)