First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics
Not on the map. Why?
Abstract (arXiv)
We study FO-rewritability of conjunctive queries in the presence of ontologies formulated in a description logic between EL and Horn-SHIF, along with related query containment problems. Apart from providing characterizations, we establish complexity results ranging from ExpTime via NExpTime to 2ExpTime, pointing out several interesting effects. In particular, FO-rewriting is more complex for conjunctive queries than for atomic queries when inverse roles are present, but not otherwise.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 19 Nov 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1.
3 papers.