Extending DL-LiteA with (Singleton) Nominals

Proc. of the 26th Int. Workshop on Description Logics (DL). Volume 1014 of CEUR Workshop Proceedings. 2013.

In this paper we study the extension of description logics of the DL-Lite family with singleton nominals, which correspond in OWL 2 to the ObjectHasValue construct. Differently from arbitrary (non-singleton) nominals, which make query answering intractable in data complexity, we show that both knowledge base satisfiability and conjunctive query answering stay first-order rewritable when DL-LiteA is extended with singleton nominals. Our technique is based on a practically implementable algorithm based on rewriting rules, in the style of those implemented in current state-of-the-art OBDA systems based on DL-Lite, such as QuOnto and Quest. This allows us to follow the tradition of the DL-Lite family for employing relational database technology for query answering with optimal data complexity.

@inproceedings{DL-2013-nominals,
   title = "Extending DL-LiteA   with (Singleton) Nominals",
   year = "2013",
   author = "Maxim G. Haddad and Diego Calvanese",
   booktitle = "Proc. of the 26th Int. Workshop on Description Logics (DL)",
   pages = "704--723",
   volume = "1014",
   publisher = "https://ceur-ws.org/CEUR-WS.org",
   series = "CEUR Workshop Proceedings",
}