ELBotpreceq: A Horn DL Extending DL-Lite with NL Data Complexity
A new description logic, ELBotpreceq, is introduced to overcome the AC0 vs. PTime dichotomy in ontology-mediated query answering (OMQA). The literature has been shaped by first-order rewritability for DL-Lite and PTime-hardness for logics beyond it, limiting OMQA to first-order queries. However, graph-structured data targeted by OMQA typically requires NL-complete query languages like GQL and SQL/PGQ. ELBotpreceq uses a stratification mechanism for ELI that controls conjunction and recursion, enabling rewriting into graph query languages while expressing many ELI and DL-Lite ontologies. The work is presented in arXiv:2605.13367.
Key facts
- ELBotpreceq is a new Horn description logic.
- It extends DL-Lite with NL data complexity.
- OMQA faces an AC0 vs. PTime dichotomy.
- DL-Lite is first-order rewritable.
- Graph query languages like GQL and SQL/PGQ are NL-complete.
- ELBotpreceq uses stratification for ELI.
- It can be rewritten into graph query languages.
- It expresses many ELI and DL-Lite ontologies.
Entities
—