ML Anthology

Efficient Query Rewriting in the Description Logic EL and Beyond

Peter Hansen, Carsten Lutz, Inanç Seylan, Frank Wolter
IJCAI 2015 pp. 3034-3040
/ijcai/2015/hansen2015ijcai-efficient/

Abstract

We propose a new type of algorithm for computing first-order (FO) rewritings of concept queries under ELHdr-TBoxes. The algorithm is tailored towards efficient implementation, yet complete. It outputs a succinct non-recursive datalog rewriting if the input is FO-rewritable and otherwise reports non-FO-rewritability. We carry out experiments with real-world ontologies which demonstrate excellent performance in practice and show that TBoxes originating from applications admit FO-rewritings of reasonable size in almost all cases, even when in theory such rewritings are not guaranteed to exist.

PDF IJCAI Semantic Scholar

Cite

Text

Hansen et al. "Efficient Query Rewriting in the Description Logic EL and Beyond." International Joint Conference on Artificial Intelligence, 2015.

Markdown

[Hansen et al. "Efficient Query Rewriting in the Description Logic EL and Beyond." International Joint Conference on Artificial Intelligence, 2015.](https://mlanthology.org/ijcai/2015/hansen2015ijcai-efficient/)

BibTeX

@inproceedings{hansen2015ijcai-efficient,
  title     = {{Efficient Query Rewriting in the Description Logic EL and Beyond}},
  author    = {Hansen, Peter and Lutz, Carsten and Seylan, Inanç and Wolter, Frank},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2015},
  pages     = {3034-3040},
  url       = {https://mlanthology.org/ijcai/2015/hansen2015ijcai-efficient/}
}