The following pages link to Roman Kontchakov (Q253974):
Displayed 25 items.
- Games for query inseparability of description logic knowledge bases (Q253977) (← links)
- Spatial reasoning with \(\mathcal{RCC} 8\) and connectedness constraints in Euclidean spaces (Q464617) (← links)
- Logic-based ontology comparison and module extraction, with an application to DL-Lite (Q622105) (← links)
- (Q865048) (redirect page) (← links)
- On dynamic topological and metric logics (Q865049) (← links)
- Temporalising tableaux (Q1826368) (← links)
- First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
- The price of query rewriting in ontology-based data access (Q2453744) (← links)
- Spatial logics with connectedness predicates (Q2786121) (← links)
- The Complexity of Clausal Fragments of LTL (Q2870113) (← links)
- Topological Logics with Connectedness over Euclidean Spaces (Q2946698) (← links)
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics (Q2946734) (← links)
- (Q3085165) (← links)
- Exponential Lower Bounds and Separation for Query Rewriting (Q3167017) (← links)
- Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models (Q3172878) (← links)
- Undecidability of First-Order Intuitionistic and Modal Logics with Two variables (Q3370616) (← links)
- (Q3457199) (← links)
- (Q3509059) (← links)
- The DL-Lite Family and Relations (Q3651482) (← links)
- DL-Lite with Temporalised Concepts, Rigid Axioms and Roles (Q3655196) (← links)
- Ontology-Mediated Queries (Q4625649) (← links)
- On the succinctness of query rewriting over shallow ontologies (Q4635642) (← links)
- On the Computational Complexity of Spatial Logics with Connectedness Constraints (Q5505582) (← links)
- (Q5715695) (← links)
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries (Q5870513) (← links)