Zobrazeno 1 - 10
of 95
pro vyhledávání: '"Kontchakov, Roman"'
Definite descriptions, such as 'the General Chair of KR 2024', are a semantically transparent device for object identification in knowledge representation. In first-order modal logic, definite descriptions have been widely investigated for their non-
Externí odkaz:
http://arxiv.org/abs/2405.07656
Autor:
Artale, Alessandro, Kontchakov, Roman, Kovtunova, Alisa, Ryzhikov, Vladislav, Wolter, Frank, Zakharyaschev, Michael
Aiming at ontology-based data access to temporal data, we design two-dimensional temporal ontology and query languages by combining logics from the (extended) DL-Lite family with linear temporal logic LTL over discrete time (Z,<). Our main concern is
Externí odkaz:
http://arxiv.org/abs/2111.06806
Autor:
Artale, Alessandro, Kontchakov, Roman, Kovtunova, Alisa, Ryzhikov, Vladislav, Wolter, Frank, Zakharyaschev, Michael
We investigate ontology-based data access to temporal data. We consider temporal ontologies given in linear temporal logic LTL interpreted over discrete time (Z,<). Queries are given in LTL or MFO(<), monadic first-order logic with a built-in linear
Externí odkaz:
http://arxiv.org/abs/2004.07221
OPTIONAL is a key feature in SPARQL for dealing with missing information. While this operator is used extensively, it is also known for its complexity, which can make efficient evaluation of queries with OPTIONAL challenging. We tackle this problem i
Externí odkaz:
http://arxiv.org/abs/1806.05918
Autor:
Bienvenu, Meghyn, Kikot, Stanislav, Kontchakov, Roman, Podolskii, Vladimir V., Ryzhikov, Vladislav, Zakharyaschev, Michael
Our concern is the overhead of answering OWL 2 QL ontology-mediated queries (OMQs) in ontology-based data access compared to evaluating their underlying tree-shaped and bounded treewidth conjunctive queries (CQs). We show that OMQs with bounded-depth
Externí odkaz:
http://arxiv.org/abs/1702.03358
Autor:
Artale, Alessandro, Kontchakov, Roman, Kovtunova, Alisa, Ryzhikov, Vladislav, Wolter, Frank, Zakharyaschev, Michael
Publikováno v:
In Artificial Intelligence October 2021 299
Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity
Autor:
Bienvenu, Meghyn, Kikot, Stanislav, Kontchakov, Roman, Podolskii, Vladimir, Zakharyaschev, Michael
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 pr
Externí odkaz:
http://arxiv.org/abs/1605.01207
Autor:
Bienvenu, Meghyn, Kikot, Stanislav, Kontchakov, Roman, Podolskii, Vladimir V., Zakharyaschev, Michael
We show that, for OWL 2 QL ontology-mediated queries with (i) ontologies of bounded depth and conjunctive queries of bounded treewidth, (ii) ontologies of bounded depth and bounded-leaf tree-shaped conjunctive queries, and (iii) arbitrary ontologies
Externí odkaz:
http://arxiv.org/abs/1604.05258