?
Temporal Description Logic for Ontology-Based Data Access
Ch. 112. P. 711–718.
Artale A., Kontchakov R., Wolter F., Zakharyaschev M.
Our aim is to investigate ontology-based data access over temporal data with validity time and ontologies capable of temporal conceptual modelling. To this end, we design a temporal description logic, TQL, that extends the standard ontology language OWL 2 QL, provides basic means for temporal conceptual modelling and ensures first-order rewritability of conjunctive queries for suitably defined data instances with validity time.
Full 20 pages paper:
In book
Beijing: AAAI Press, 2013.
Gerasimova O., Kikot S., Podolskii V. V. et al., Artificial Intelligence 2022 Vol. 309 Article 103738
Our concern is the problem of efficiently determining the data complexity of answering queries mediated by description logic ontologies and constructing their optimal rewritings to standard database queries. Originated in ontology-based data access and datalog optimisation, this problem is known to be computationally very complex in general, with no explicit syntactic characterisations available. In this ...
Added: May 30, 2022
Zakharyaschev M., Savateev Y., Ryzhikov V., Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2021.
Our concern is the problem of determining the data complexity of answering an ontology-mediated query (OMQ) given in linear temporal logic LTL over (Z, <) and deciding whether it is rewritable to an FO(<)-query, possibly with extra predicates. First, we observe that, in line with the circuit complexity and FO-definability of regular languages, OMQ answering ...
Added: November 6, 2021
CEUR-WS.org, 2019.
Added: October 29, 2019
Gerasimova O., Kikot S., Zakharyaschev M., , in: Description Logic, Theory Combination, and All That.: Berlin: Springer, 2019. P. 329–351.
It has recently been shown that first-order- and datalog-rewritability of ontology-mediated queries (OMQs) with expressive ontologies can be checked in NExpTime using a reduction to CSPs. In this paper, we present a case study for OMQs with Boolean conjunctive queries and a fixed ontology consisting of a single covering axiom 𝐴 -> 𝐹 v 𝑇, A -> F v T, possibly supplemented with ...
Added: July 29, 2019
Berlin: Springer, 2019.
This Festschrift has been put together on the occasion of Franz Baader's 60th birthday to celebrate his fundamental and highly influential scientific contributions. The 30 papers in this volume cover several scientific areas that Franz Baader has been working on during the last three decades, including description logics, term rewriting, and the combination of decision procedures. We hope that ...
Added: July 29, 2019
Zakharyaschev M., Kontchakov R., , in: Artificial Intelligence* 234.: [б.и.], 2016. P. 78–119.
We consider conjunctive query inseparability of description logic knowledge bases with respect to a given signature - a fundamental problem in knowledge base versioning, module extraction, forgetting and knowledge exchange. We give a uniform game-theoretic characterisation of knowledge base conjunctive query inseparability and develop worst-case optimal decision algorithms for fragments of Horn-ALCHI, including the description ...
Added: September 18, 2017
Rodríguez-Muro M., Kontchakov R., Zakharyaschev M., , in: The Semantic Web – ISWC 2013. Proceedings of12th International Semantic Web Conference, Part I.: Cham: Springer, 2013. Ch. 35 P. 558–573.
We present the architecture and technologies underpinning the OBDA system Ontop and taking full advantage of storing data in relational databases. We discuss the theoretical foundations of Ontop: the tree-witness query rewriting,T-mappings and optimisations based on database integrity constraints and SQL features. We analyse the performance of Ontop in a series of experiments and demonstrate ...
Added: March 26, 2015
Botoeva E., Kontchakov R., Ryzhikov V. et al., , in: Proceedings, Fourteenth International Conference on Principles of Knowledge Representation and Reasoning (KR-14).: Palo Alto: AAAI Press, 2014. Ch. 25 P. 25.1–25.10.
We investigate conjunctive query inseparability of description logic (DL) knowledge bases (KBs) with respect to a given signature, a fundamental problem for KB versioning, module extraction, forgetting and knowledge exchange. We study the data and combined complexity of deciding KB query inseparability for fragments of Horn-ALCHI, including the DLs underpinning OWL 2 QL and OWL ...
Added: March 25, 2015
Mosurovic M., Krdzavac N., Graves H. et al., Journal of Artificial Intelligence Research 2013 Vol. 47 P. 809–851
We design a decidable extension of the description logic SROIQ underlying the Web Ontology Language OWL 2. The new logic, called SR+OIQ, supports a controlled use of role axioms whose right-hand side may contain role chains or role unions. We give a tableau algorithm for checking concept satisfiability with respect to SR+OIQ ontologies and prove ...
Added: March 25, 2015
Artale A., Kontchakov R., Ryzhikov V. et al., ACM Transactions on Computational Logic 2014 Vol. 15 No. 3 P. 25.1–25.50
We design temporal description logics (TDLs) suitable for reasoning about temporal conceptual data models and investigate their computational complexity. Our formalisms are based on DL-Lite logics with three types of concept inclusions (ranging from atomic concept inclusions and disjointness to the full Booleans), as well as cardinality constraints and role inclusions. The logics are interpreted ...
Added: March 25, 2015
Khoroshevsky V. F., Efimenko I., В кн.: XIV Национальная конференция по искусственному интеллекту с международным участием КИИ-2014.: Каз.: Российская ассоциация искусственного интеллекта, 2014. С. 160–168.
В статье представлены результаты наукометрического исследования научного направления "Искусственный интеллект", выполененного на основе лингвистико-статистического анализа корпуса трудов Российской ассоциации искусственного интеллекта. ...
Added: October 23, 2014
Irina V. Efimenko, Khoroshevsky V. F., Lecture Notes in Computer Science 2014 No. 8722 P. 170–177
A hybrid approach to automated identification and monitoring of technology trends is presented. The hybrid approach combines methods of ontology based information extraction and statistical methods for processing OBIE results. The key point of the approach is the so called ‘black box’ principle. It is related to identification of trends on the basis of heuristics ...
Added: October 23, 2014
Bienvenu M., Kikot S., Podolskii V. V., , in: CEUR Workshop ProceedingsVol. 1193: Informal Proceedings of the 27th International Workshop on Description Logics. Vienna, Austria, July 17-20, 2014.: Wien: CEUR Workshop Proceedings, 2014. P. 45–57.
This paper further investigates the succinctness landscape of query rewriting in OWL 2 QL. We clarify the worst-case size of positive existential (PE), non-recursive Datalog (NDL), and first-order (FO) rewritings for various classes of tree-like conjunctive queries, ranging from linear queries up to bounded treewidth queries. More specifically, we establish a superpolynomial lower bound on ...
Added: October 20, 2014