Efficient Query Rewriting in the Description Logic EL and Beyond
IJCAI, pp. 3034-3040, 2015.
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 experimen...More
PPT (Upload PPT)