Nominals for Everyone
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 917-921.
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
@inproceedings{ijcai2009p156,
title = {Nominals for Everyone},
author = {Schröder, Lutz and Pattinson, Dirk and Kupke, Clemens},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {917--921},
year = {2009},
url = {https://ijcai.org/proceedings/2009/156},
}
TY - CPAPER TI - Nominals for Everyone AU - Schröder, Lutz AU - Pattinson, Dirk AU - Kupke, Clemens T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 917 EP - 921 UR - https://ijcai.org/proceedings/2009/156 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
