Botoeva, Elena, Artale, Alessandro, Calvanese, Diego (2010) Query Rewriting in DL-Lite_\^(HN)_horn. In: CEUR Workshop Proceedings. Proceedings of the 23rd International Workshop on Description Logics (DL 2010). CEUR Workshop Proceedings , 573. pp. 267-278. CEUR-WS.org (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:91350)
| The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
| Official URL: https://www.doc.ic.ac.uk/~ebotoeva/papers/boac-DL-... |
Abstract
In this paper we present practical algorithms for query answering and knowledge base satisfiability checking in DL-Lite(HN) horn, a logic from the extended DL-Lite family that contains horn concept inclusions and number restriction. This logic is the most expressive DL that is shown to be FOL-rewritable. The algorithms we present are based on the rewriting technique so that reasoning over the TBox and over the ABox can be done independently of each other, and the inference problems are reduced to first order query evaluation. This allows for employing relational database technology for the final query evaluation and gives optimal data complexity
| Item Type: | Conference or workshop item (Paper) |
|---|---|
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
| Depositing User: | Amy Boaler |
| Date Deposited: | 05 Nov 2021 09:42 UTC |
| Last Modified: | 16 Nov 2021 10:27 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/91350 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Download Statistics
Download Statistics
