Jakub Rydval

Orcid: 0000-0002-7961-9492

According to our database1, Jakub Rydval authored at least 11 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Identifying Tractable Quantified Temporal Constraints within Ord-Horn.
CoRR, 2024

2023
On the Descriptive Complexity of Temporal Constraint Satisfaction Problems.
J. ACM, February, 2023

2022
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains.
PhD thesis, 2022

Tractable Combinations of Temporal CSPs.
Log. Methods Comput. Sci., 2022

Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains.
J. Autom. Reason., 2022

2021
Universal Horn Sentences and the Joint Embedding Property.
Discret. Math. Theor. Comput. Sci., 2021

Amalgamation is Undecidable.
CoRR, 2021

An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics.
Proceedings of the Logics in Artificial Intelligence - 17th European Conference, 2021

2020
Temporal Constraint Satisfaction Problems in Fixed-Point Logic.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Description Logics with Concrete Domains and General Concept Inclusions Revisited (Extended Abstract).
Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), 2020

Description Logics with Concrete Domains and General Concept Inclusions Revisited.
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020


  Loading...