Jung, J.C. and Papacchini, F. and Wolter, F. and Zakharyaschev, Michael (2019) Model Comparison Games for Horn Description Logics. In: UNSPECIFIED (ed.) 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). ACM. ISBN 9781728136080.
|
Text
lics19.pdf Download (359kB) | Preview |
Abstract
Horn description logics are syntactically defined fragments of standard description logics that fall within the Horn fragment of first-order logic and for which ontology-mediated query answering is in PTIME for data complexity. They were independently introduced in modal logic to capture the intersection of Horn first-order logic with modal logic. In this paper, we introduce model comparison games for the basic Horn description logic hornALC (corresponding to the basic Horn modal logic) and use them to obtain an Ehrenfeucht-Fra ̈ısse ́ type definability result and a van Benthem style expressive completeness result for hornALC. We also establish a finite model theory version of the latter. The Ehrenfeucht-Fra ̈ısse ́ type definability result is used to show that checking hornALC indistinguishability of models is EXPTIME-complete, which is in sharp contrast to ALC indistinguishability (i.e., bisimulation equivalence) checkable in PTIME. In addition, we explore the behavior of Horn fragments of more expressive description and modal logics by defining a Horn guarded fragment of first-order logic and introducing model comparison games for it.
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: | 12 Dec 2019 14:51 |
| Last Modified: | 15 Apr 2025 22:15 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/27721 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
