?
Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries
P. 45–57.
Bienvenu M., Kikot S., Подольский В. В.
В книге
Vol. 1193: Informal Proceedings of the 27th International Workshop on Description Logics. Vienna, Austria, July 17-20, 2014. , Wien: CEUR Workshop Proceedings, 2014.
Герасимова О. А., Kikot S., Подольский В. В. и др., 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 ...
Добавлено: 30 мая 2022 г.
Захарьящев М. В., Саватеев Ю. В., Ryzhikov V., Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2021.
Добавлено: 6 ноября 2021 г.
CEUR-WS.org, 2019.
Добавлено: 29 октября 2019 г.
Герасимова О. А., Kikot S., Захарьящев М. В., , 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 ...
Добавлено: 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 ...
Добавлено: 29 июля 2019 г.
Захарьящев М. В., Kontchakov R., , in: Artificial Intelligence* 234.: [б.и.], 2016. P. 78–119.
Добавлено: 18 сентября 2017 г.
Подольский В. В., Захарьящев М. В., Bienvenu M. и др., , in: Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems* F127745.: ACM, 2017. P. 201–216.
Добавлено: 17 сентября 2017 г.
Подольский В. В., Bienvenu M., Kikot S., , in: Logic in Computer Science (LICS), 2015 30th Annual ACM/IEEE Symposium on.: Los Alamitos: IEEE, 2015. P. 317–328.
Добавлено: 19 октября 2016 г.
Botoeva E., Kontchakov R., Ryzhikov V. и др., , 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.
Добавлено: 25 марта 2015 г.
Mosurovic M., Krdzavac N., Graves H. и др., 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 ...
Добавлено: 25 марта 2015 г.
Artale A., Kontchakov R., Ryzhikov V. и др., 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 over the ...
Добавлено: 25 марта 2015 г.
Gottlob G., Kikot S., Kontchakov R. и др., Artificial Intelligence 2014 Vol. 213 P. 42–59
Добавлено: 24 марта 2015 г.
Artale A., Kontchakov R., Wolter F. и др., , in: Proceedings of the 23rd International Joint Conference on Artificial Intelligence.: Beijing: AAAI Press, 2013. Ch. 112 P. 711–718.
Добавлено: 24 марта 2015 г.
Kikot S., Kontchakov R., Подольский В. В. и др., , in: 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).: NY: ACM, 2014. P. 1–10.
Добавлено: 20 октября 2014 г.
Gottlob G., Kikot S., Kontchakov R. и др., Artificial Intelligence 2014 Vol. 213 P. 42–59
We give a solution to the succinctness problem for the size of first-order rewritings of conjunctive queries in ontologybased data access with ontology languages such as OWL2QL, linear Datalog and sticky Datalog. We show that positive existential and nonrecursive datalog rewritings, which do not use extra non-logical symbols (except for intensional predicates in the case ...
Добавлено: 20 октября 2014 г.