Exponential Lower Bounds and Separation for Query Rewriting
From MaRDI portal
Publication:3167017
DOI10.1007/978-3-642-31585-5_26zbMath1367.68089arXiv1202.4193OpenAlexW2137498727MaRDI QIDQ3167017
Roman Kontchakov, Stanislav Kikot, Michael Zakharyashchev, Vladimir V. Podolskii
Publication date: 1 November 2012
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.4193
Database theory (68P15) Knowledge representation (68T30) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic programming (68N17)
Related Items (5)
Circuit Complexity Meets Ontology-Based Data Access ⋮ Bounds in ontology-based data access via circuit complexity ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ The price of query rewriting in ontology-based data access ⋮ Scalable Reasoning by Abstraction Beyond DL-Lite
This page was built for publication: Exponential Lower Bounds and Separation for Query Rewriting