Roman Kontchakov

From MaRDI portal
(Redirected from Person:253974)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Ontology-mediated query answering over temporal data: a survey (invited talk)
1515.68296
2023-02-03Paper
First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
Journal of Artificial Intelligence Research
2023-01-09Paper
First-order rewritability of ontology-mediated queries in linear temporal logic
Artificial Intelligence
2021-11-02Paper
Ontology-mediated queries. Combined complexity and succinctness of rewritings via circuit complexity
Journal of the ACM
2019-02-25Paper
On the succinctness of query rewriting over shallow ontologies
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
2018-04-23Paper
On the succinctness of query rewriting over shallow ontologies
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
2018-04-23Paper
Games for query inseparability of description logic knowledge bases
Artificial Intelligence
2016-03-08Paper
DL-Lite with attributes and datatypes2015-12-11Paper
Topological logics with connectedness over Euclidean spaces
ACM Transactions on Computational Logic
2015-09-17Paper
A Cookbook for Temporal Conceptual Data Modelling with Description Logics
ACM Transactions on Computational Logic
2015-09-17Paper
A Cookbook for Temporal Conceptual Data Modelling with Description Logics
ACM Transactions on Computational Logic
2015-09-17Paper
Spatial reasoning with \(\mathcal{RCC} 8\) and connectedness constraints in Euclidean spaces
Artificial Intelligence
2014-10-27Paper
The price of query rewriting in ontology-based data access
Artificial Intelligence
2014-06-10Paper
The complexity of clausal fragments of LTL
Logic for Programming, Artificial Intelligence, and Reasoning
2014-01-17Paper
Exponential lower bounds and separation for query rewriting
Automata, Languages, and Programming
2012-11-01Paper
Exponential lower bounds and separation for query rewriting
Automata, Languages, and Programming
2012-11-01Paper
Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models
Frontiers of Combining Systems
2011-10-07Paper
Topology, connectedness, and modal logic2011-03-30Paper
Logic-based ontology comparison and module extraction, with an application to DL-Lite
Artificial Intelligence
2011-01-31Paper
Spatial logics with connectedness predicates
Logical Methods in Computer Science
2010-09-21Paper
DL-Lite with temporalised concepts, rigid axioms and roles
Frontiers of Combining Systems
2010-01-07Paper
The DL-Lite Family and Relations
Journal of Artificial Intelligence Research
2009-12-10Paper
On the Computational Complexity of Spatial Logics with Connectedness Constraints
Logic for Programming, Artificial Intelligence, and Reasoning
2009-01-27Paper
scientific article; zbMATH DE number 5295716 (Why is no real title available?)2008-07-01Paper
On dynamic topological and metric logics
Studia Logica
2007-02-13Paper
Undecidability of First-Order Intuitionistic and Modal Logics with Two variables
The Bulletin of Symbolic Logic
2006-02-08Paper
scientific article; zbMATH DE number 2243382 (Why is no real title available?)
(available as arXiv preprint)
2006-01-04Paper
Temporalising tableaux
Studia Logica
2004-08-06Paper


Research outcomes over time


This page was built for person: Roman Kontchakov