Bounded Predicates in Description Logics with Counting
Sanja Lukumbuzya, Mantas Simkus
Abstract
Description Logics (DLs) support so-called anonymous objects, which significantly contribute to the expressiveness of these KR languages, but also cause substantial computational challenges. This paper investigates reasoning about upper bounds on predicate sizes for ontologies written in the expressive DL ALCHOIQ extended with closed predicates. We describe a procedure based on integer programming that allows us to decide the existence of upper bounds on the cardinality of some predicate in the models of a given ontology in a data-independent way. Our results yield a promising supporting tool for constructing higher quality ontologies, and provide a new way to push the decidability frontiers. To wit, we define a new safety condition for Datalog-based queries over DL ontologies, while retaining decidability of query entailment.
BibTeX
@inproceedings{ijcai2021p271,
title = {Bounded Predicates in Description Logics with Counting},
author = {Lukumbuzya, Sanja and Simkus, Mantas},
booktitle = {Proceedings of the Thirtieth International Joint Conference on
Artificial Intelligence, {IJCAI-21}},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
editor = {Zhi-Hua Zhou},
pages = {1966--1972},
year = {2021},
month = {8},
note = {Main Track},
doi = {10.24963/ijcai.2021/271},
url = {https://doi.org/10.24963/ijcai.2021/271},
}