Botoeva, E. and Lutz, C. and Ryzhikov, Vladislav and Wolter, F. and Zakharyaschev, Michael (2016) Query-based entailment and inseparability for ALC ontologies. In: UNSPECIFIED (ed.) The 25th International Joint Conference on Artificial Intelligence IJCAI-16. Palo Alto, U.S.: AAAI Press / International Joint Conferences on Artificial Intelligence, pp. 1001-1007. ISBN 9781577357704.
|
Text
ALC-IJCAI16-final.pdf - Author's Accepted Manuscript Download (372kB) | Preview |
Abstract
We investigate the problem whether two ALC knowledge bases are indistinguishable by queries over a given vocabulary. We give model-theoretic criteria and prove that this problem is undecid- able for conjunctive queries (CQs) but decidable in 2EXPTIME for unions of rooted CQs. We also consider the problem whether two ALC TBoxes give the same answers to any query in a given vocabulary over all ABoxes, and show that for CQs this problem is undecidable, too, but becomes decidable and 2EXPTIME-complete in Horn-ALC, and even EXPTIME-complete in Horn-ALC when restricted to (unions of) rooted CQs.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Michael Zakhariyashchev |
| Date Deposited: | 25 Aug 2016 14:37 |
| Last Modified: | 09 Aug 2023 12:38 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/15362 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
