Efficient Answer Enumeration in Description Logics with Functional Roles

Abstract

We study the enumeration of answers to ontology-mediated queries when the ontology is formulated in a description logic that supports functional roles and the query is a CQ. In particular, we show that enumeration is possible with linear preprocessing and constant delay when a certain extension of the CQ (pertaining to functional roles) is acyclic and free-connex acyclic. This holds both for complete answers and for partial answers. We provide matching lower bounds for the case where the query is self-join free.

Cite

Text

Lutz and Przybylko. "Efficient Answer Enumeration in Description Logics with Functional Roles." AAAI Conference on Artificial Intelligence, 2023. doi:10.1609/AAAI.V37I5.25797

Markdown

[Lutz and Przybylko. "Efficient Answer Enumeration in Description Logics with Functional Roles." AAAI Conference on Artificial Intelligence, 2023.](https://mlanthology.org/aaai/2023/lutz2023aaai-efficient/) doi:10.1609/AAAI.V37I5.25797

BibTeX

@inproceedings{lutz2023aaai-efficient,
  title     = {{Efficient Answer Enumeration in Description Logics with Functional Roles}},
  author    = {Lutz, Carsten and Przybylko, Marcin},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2023},
  pages     = {6483-6490},
  doi       = {10.1609/AAAI.V37I5.25797},
  url       = {https://mlanthology.org/aaai/2023/lutz2023aaai-efficient/}
}