Nominals for Everyone
Abstract
It has been recognised that the expressivity of description logics benefits from the introduction of non-standard modal operators beyond existential and number restrictions. Such operators support notions such as uncertainty, defaults, agency, obligation, or evidence, whose semantics often lies outside the realm of relational structures. Coalgebraic hybrid logic serves as a unified setting for logics that combine non-standard modal operators and nominals, which allow reasoning about individuals. In this framework, we prove a generic EXPTIME upper bound for concept satisfiability over general TBoxes, which instantiates to novel upper bounds for many individual logics including probabilistic logic with nominals. Lutz Schr�der, Dirk Pattinson, Clemens Kupke
Cite
Text
Schröder et al. "Nominals for Everyone." International Joint Conference on Artificial Intelligence, 2009.Markdown
[Schröder et al. "Nominals for Everyone." International Joint Conference on Artificial Intelligence, 2009.](https://mlanthology.org/ijcai/2009/schroder2009ijcai-nominals/)BibTeX
@inproceedings{schroder2009ijcai-nominals,
title = {{Nominals for Everyone}},
author = {Schröder, Lutz and Pattinson, Dirk and Kupke, Clemens},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2009},
pages = {917-922},
url = {https://mlanthology.org/ijcai/2009/schroder2009ijcai-nominals/}
}