Video library: V. V. Podolskii, Bounds on the size of query rewritings in ontology based data access

Videolibrary

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

Scientific session of the Steklov Mathematical Institute of RAS dedicated to the results of 2015
November 11, 2015 11:45–12:00, Moscow, Steklov Mathematical Institute of RAS, Conference Hall (8 Gubkina)

Bounds on the size of query rewritings in ontology based data access

V. V. Podolskii

References

Georg Gottlob, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Thomas Schwentick, Michael Zakharyaschev, “The price of query rewriting in ontology-based data access”, Artificial Intelligence, 213 (2014), 42–59
Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev, “On the Succinctness of Query Rewriting over OWL 2 QL Ontologies with Bounded Chase”, 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), ACM Digital Library, 2014, 57:1–57:10 , arXiv: 1401.4420
Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii, “Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results”, 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), IEEE, 2015, 317–328 , arXiv: 1406.3047

Related articles:

Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results
Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii
LICS, 2015, 317–328