Botoeva, Elena, Kontchakov, Roman, Ryzhikov, Vladislav, Wolter, Frank, Zakharyaschev, Michael (2015) When Are Description Logic Knowledge Bases Indistinguishable? In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence ( IJCAI 2015). . pp. 4240-4246. Association for the Advancement of Artificial Intelligence ISBN 978-1-57735-738-4. (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:91286)
| 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: http://ijcai.org/Abstract/15/603 |
Abstract
Deciding inseparability of description logic knowledge bases (KBs) with respect to conjunctive queries is fundamental for many KB engineering and maintenance tasks including versioning, module extraction, knowledge exchange and forgetting. We study the combined and data complexity of this inseparability problem for fragments of Horn-ALCHI, including the description logics underpinning OWL 2 QL and OWL 2 EL.
| Item Type: | Conference or workshop item (Proceeding) |
|---|---|
| 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: | 03 Nov 2021 10:57 UTC |
| Last Modified: | 05 Nov 2024 12:56 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/91286 (The current URI for this page, for reference purposes) |
University of Kent Author Information
Botoeva, Elena.
| Creator's ORCID: |
 https://orcid.org/0000-0001-5881-0258
|
|---|---|
| CReDIT Contributor Roles: |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Download Statistics
Download Statistics
