Search Results for author: Roman Kontchakov

Found 4 papers, 0 papers with code

Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity

no code implementations4 May 2016 Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir Podolskii, Michael Zakharyaschev

We give solutions to two fundamental computational problems in ontology-based data access with the W3C standard ontology language OWL 2 QL: the succinctness problem for first-order rewritings of ontology-mediated queries (OMQs), and the complexity problem for OMQ answering.

The DL-Lite Family and Relations

no code implementations15 Jan 2014 Alessandro Artale, Diego Calvanese, Roman Kontchakov, Michael Zakharyaschev

The recently introduced series of description logics under the common moniker DL-Lite has attracted attention of the description logic and semantic web communities due to the low computational complexity of inference, on the one hand, and the ability to represent conceptual modeling formalisms, on the other.

Temporal Description Logic for Ontology-Based Data Access (Extended Version)

no code implementations18 Apr 2013 Alessandro Artale, Roman Kontchakov, Frank Wolter, Michael Zakharyaschev

Our aim is to investigate ontology-based data access over temporal data with validity time and ontologies capable of temporal conceptual modelling.

A Cookbook for Temporal Conceptual Data Modelling with Description Logics

no code implementations25 Sep 2012 Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev

We design temporal description logics suitable for reasoning about temporal conceptual data models and investigate their computational complexity.

Cannot find the paper you are looking for? You can Submit a new open access paper.