Efficient Query Rewriting in the Description Logic EL and Beyond
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Special Track on Knowledge Representation and Reasoning. Pages 3034-3039.
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.
@inproceedings{ijcai2015p428,
title = {Efficient Query Rewriting in the Description Logic EL and Beyond},
author = {Hansen, Peter and Lutz, Carsten and Seylan, Inanç and Wolter, Frank},
booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-15}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Qiang Yang and Michael Wooldridge},
pages = {3034--3039},
year = {2015},
month = {7},
note = {Special Track on Knowledge Representation and Reasoning},
url = {https://ijcai.org/proceedings/2015/428},
}
TY - CPAPER TI - Efficient Query Rewriting in the Description Logic EL and Beyond AU - Hansen, Peter AU - Lutz, Carsten AU - Seylan, Inanç AU - Wolter, Frank T2 - Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15 PB - International Joint Conferences on Artificial Intelligence PY - 2015 SP - 3034 EP - 3039 UR - https://ijcai.org/proceedings/2015/428 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: