كتاب
Data complexity of query answering in description logics (Extended abstract)
| العنوان: | Data complexity of query answering in description logics (Extended abstract) |
|---|---|
| المؤلفون: | Calvanese D, De Giacomo G, Lembo D, Lenzerini M, Rosati R |
| بيانات النشر: | AAAI Press |
| سنة النشر: | 2017 |
| المجموعة: | Free University of Bozen-Bolzano (UNIBZ): BIA (Bozen-Bolzano Institutional Archive) |
| الوصف: | We study the data complexity of answering conjunctive queries over Description Logic knowledge bases constituted by a TBox and an ABox. In particular, we are interested in characterizing the FO-rewritability and the polynomial tractability boundaries of conjunctive query answering, depending on the expressive power of the DL used to express the knowledge base. What emerges from our complexity analysis is that the Description Logics of the DL-Lite family are essentially the maximal logics allowing for conjunctive query answering through standard database technology. ; open |
| نوع الوثيقة: | book part |
| وصف الملف: | application/pdf |
| اللغة: | English |
| ردمك: | 978-1-57735-738-4 1-57735-738-8 |
| تدمد: | 1045-0823 |
| العلاقة: | http://ijcai.org/Abstract/15/588Test; http://hdl.handle.net/10863/1878Test; https://www.aaai.org/ocs/index.php/IJCAI/IJCAI15/paper/viewPaper/11362Test |
| الإتاحة: | http://hdl.handle.net/10863/1878Test http://ijcai.org/Abstract/15/588Test https://www.aaai.org/ocs/index.php/IJCAI/IJCAI15/paper/viewPaper/11362Test |
| رقم الانضمام: | edsbas.CAFBB74D |
| قاعدة البيانات: | BASE |
Full Text Finder | ردمك: | 9781577357384 1577357388 |
|---|---|
| تدمد: | 10450823 |