Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results

DOI10.1109/LICS.2015.38zbMath1401.68058arXiv1406.3047OpenAlexW1944768628MaRDI QIDQ4635814

Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii

Publication date: 23 April 2018

Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Knowledge representation (68T30) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Bounds in ontology-based data access via circuit complexity ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics

This page was built for publication: Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results