Urmăriți
Jakub Rydval
Jakub Rydval
Adresă de e-mail confirmată pe tuwien.ac.at - Pagina de pornire
Titlu
Citat de
Citat de
Anul
Description logics with concrete domains and general concept inclusions revisited
F Baader, J Rydval
International Joint Conference on Automated Reasoning, 413-431, 2020
182020
On the descriptive complexity of temporal constraint satisfaction problems
M Bodirsky, J Rydval
Journal of the ACM 70 (1), 1-58, 2022
152022
Temporal constraint satisfaction problems in fixed-point logic
M Bodirsky, W Pakusa, J Rydval
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020
142020
Using model theory to find decidable and tractable description logics with concrete domains
F Baader, J Rydval
Journal of Automated Reasoning 66 (3), 357-407, 2022
132022
An algebraic view on p-admissible concrete domains for lightweight description logics
F Baader, J Rydval
European Conference on Logics in Artificial Intelligence, 194-209, 2021
52021
Using model-theory to find ω-admissible concrete domains. LTCS-Report 20-01, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden …
F Baader, J Rydval
5
Tractable combinations of temporal CSPs
M Bodirsky, J Greiner, J Rydval
Logical Methods in Computer Science 18, 2022
42022
Universal Horn sentences and the joint embedding property
M Bodirsky, J Rydval, A Schrottenloher
Discrete Mathematics & Theoretical Computer Science 23 (Special issues), 2022
42022
Using model theory to find decidable and tractable description logics with concrete domains
J Rydval
32022
Homogeneity and Homogenizability: Hard Problems for the Logic SNP
J Rydval
51st International Colloquium on Automata, Languages, and Programming (ICALP …, 2024
22024
Finitely Bounded Homogeneity Turned Inside-Out
J Rydval
arXiv preprint arXiv:2108.00452, 2021
22021
An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics: Extended Version
F Baader
Deutsche Nationalbibliothek, 2020
12020
Three meta-questions on infinite-domain Constraint Satisfaction Problems
M Pinsker, J Rydval, M Schöbi, C Spiess
arXiv preprint arXiv:2502.06621, 2025
2025
Identifying Tractable Quantified Temporal Constraints Within Ord-Horn
J Rydval, Ž Semanišinová, M Wrona
51st International Colloquium on Automata, Languages, and Programming (ICALP …, 2024
2024
Containment for Guarded Monotone Strict NP
A Barsukov, M Pinsker, J Rydval
arXiv preprint arXiv:2310.01254, 2023
2023
LTCS–Report
M Bodirsky, W Pakusa, J Rydval
2020
Using model theory to find w-admissible concrete domains
F Baader, J Rydval
2020
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–17