Query Rewriting in DL-LiteHNhorn

Elena Botoeva, Alessandro Artale, and Diego Calvanese

Proc. of the 23rd Int. Workshop on Description Logics (DL 2010). Volume 573 of CEUR Workshop Proceedings, http://ceur-ws.org/. 2010.

In this paper we present practical algorithms for query answering and checking knowledge base satisfiability in DL-Lite(RNhor)n, a logic from the extended DL-Lite family that contains horn concept inclusions and number restriction. It is the most expressive logic within DL-Lite that is shown to be FOL-rewritable. The algorithms are based on the rewriting technique so that reasoning over TBox and over ABox can be done independently of each other, and the initial problems are reduced to first order query evaluation. It allows for employing relational database technology for the final query evaluation and gives the optimal data complexity.


@inproceedings{DL-2010-rewriting,
   title = "Query Rewriting in DL-LiteHNhorn",
   year = "2010",
   author = "Elena Botoeva and Alessandro Artale and Diego Calvanese",
   booktitle = "Proc. of the 23rd Int. Workshop on Description Logics
(DL 2010)",
   pages = "267--278",
   volume = "573",
   series = "CEUR Workshop Proceedings, http://ceur-ws.org/",
}
pdf url