On the succinctness of query rewriting over shallow ontologies

DOI10.1145/2603088.2603131zbMath1401.68316arXiv1401.4420OpenAlexW1982479815WikidataQ62048610 ScholiaQ62048610MaRDI QIDQ4635642

Roman Kontchakov, Stanislav Kikot, Michael Zakharyashchev, Vladimir V. Podolskii

Publication date: 23 April 2018

Published 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) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.4420

zbMATH Keywords

description logicsuccinctnessBoolean circuit complexityontology-based data accessfirst-order query rewriting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Data structures (68P05)

Related Items

Circuit Complexity Meets Ontology-Based Data Access ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ Logical foundations of information disclosure in ontology-based data integration ⋮ The price of query rewriting in ontology-based data access