Abstract
Consistent query answering over description logic based ontologies is an important topic in ontology engineering as it can provide meaningful answers to queries posed over inconsistent ontologies. Current approaches for dealing with this problem usually consist of two steps: the first one is to extract some consistent sub-ontologies of an inconsistent ontology, and then the second one is to pose the query over these consistent sub-ontologies. In this paper, we propose an alternative approach to consistent query answering for conjunctive queries over DL-Lite ontologies based on four-valued semantics, where DL-Lite is a family of tractable Description Logics DLs. We give an algorithm to compute answers to a query over an inconsistent DL-Lite ontology and show that it is tractable. In particular, we show that it is in PTime with respect to the size of the TBox, and is LOGSPACE with respect to the size of the ABox.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Web Intelligence and Agent Systems: An International Journal
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
