Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints
From International Center for Computational Logic
Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints
Franz BaaderFranz Baader, Bartosz BednarczykBartosz Bednarczyk, Sebastian RudolphSebastian Rudolph
Franz Baader, Bartosz Bednarczyk, Sebastian Rudolph
Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints
In Giuseppe De Giacomo. Alejandro Catala, Bistra Dilkina, Michela Milano, Senen Barro and Alberto Bugarin, Jerome Lang, eds., Proceedings of the 24th European Conference on Artificial Intelligence (ECAI 2020), volume 325 of Frontiers in Artificial Intelligence and Applications, 616-623, June 2020. IOS Press
Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints
In Giuseppe De Giacomo. Alejandro Catala, Bistra Dilkina, Michela Milano, Senen Barro and Alberto Bugarin, Jerome Lang, eds., Proceedings of the 24th European Conference on Artificial Intelligence (ECAI 2020), volume 325 of Frontiers in Artificial Intelligence and Applications, 616-623, June 2020. IOS Press
- KurzfassungAbstract
We introduce and investigate the expressive description logic (DL) ALCSCC++, in which the global and local cardinality constraints introduced in previous papers can be mixed. Weprove that the added expressivity does not increase the complexity of satisfiability checking and other standard inference problems. However, reasoning in ALCSCC++ becomes undecidable if inverse roles are added or conjunctive query entailment is considered. We prove that decidability of querying can be regained if global and local constraints are not mixed and the global constraints are appropriately restricted. In this setting, query entailment can be shown to be
EXPTIME-complete and hence not harder than reasoning in ALC. - Weitere Informationen unter:Further Information: Link
- Projekt:Project: DeciGUT
- Forschungsgruppe:Research Group: Computational LogicComputational Logic
@inproceedings{BBR2020,
author = {Franz Baader and Bartosz Bednarczyk and Sebastian Rudolph},
title = {Satisfiability and Query Answering in Description Logics with
Global and Local Cardinality Constraints},
editor = {Giuseppe De Giacomo. Alejandro Catala and Bistra Dilkina and
Michela Milano and Senen Barro and Alberto Bugarin and Jerome
Lang},
booktitle = {Proceedings of the 24th European Conference on Artificial
Intelligence (ECAI 2020)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {325},
publisher = {IOS Press},
year = {2020},
month = {June},
pages = {616-623},
doi = {10.3233/FAIA200146}
}