Proceedings

Efficient Query Rewriting in the Description Logic EL and Beyond

Download BibTeX Cite

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.

Peter Hansen, Carsten Lutz, Inanç Seylan, and Frank Wolter. 2015. Efficient Query Rewriting in the Description Logic EL and Beyond. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15. IJCAI, 3034–3039. https://ijcai.org/proceedings/2015/428
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards