Show simple item record

dc.contributor.authorCalvanese D
dc.contributor.authorDe Giacomo G
dc.contributor.authorLenzerini M
dc.contributor.authorRosati R
dc.contributor.editor
dc.date.accessioned2018-09-03T09:48:55Z
dc.date.available2018-09-03T09:48:55Z
dc.date.issued2012
dc.identifier.issn0022-0000
dc.identifier.urihttp://dx.doi.org/10.1016/j.jcss.2011.02.011
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S0022000011000407
dc.identifier.urihttp://hdl.handle.net/10863/5948
dc.description.abstractView-based query answering is the problem of answering a query based only on the precomputed answers to a set of views. While this problem has been widely investigated in databases, it is largely unexplored in the context of Description Logic ontologies.  Differently from traditional databases, Description Logics may express several forms of incomplete information, and this poses challenging problems in characterizing the semantics of views.  In this paper, we first present a general framework for view-based query answering, where we address the above semantical problems by providing two notions of view-based query answering over ontologies, all based on the idea that the precomputed answers to views are the certain answers to the corresponding queries. We also relate such notions to privacy-aware access to ontologies.  Then, we provide decidability results, algorithms, and data complexity characterizations for view-based query answering in several Description Logics, ranging from those with limited modeling capability to highly expressive ones.en_US
dc.language.isoenen_US
dc.rights
dc.titleView-based query answering in description logics: Semantics and complexityen_US
dc.typeArticleen_US
dc.date.updated2018-09-03T07:02:58Z
dc.publication.title
dc.language.isiEN-GB
dc.journal.titleJournal of Computer and System Sciences
dc.description.fulltextopenen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record