by Lutz Schröder, Dirk Pattinson and Clemens Kupke
Abstract:
It has been recognised that the expressivity of ontology languages benefits from the introduction of non-standard modal operators beyond the usual existential restrictions and the number restrictions already featured by many description logics. Such operators serve to support notions such as uncertainty, defaults, agency, obligation, or evidence, which are hard to capture using only the standard operators, and whose semantics often goes beyond relational structures. We work in a unified theory for logics that combine non-standard modal operators and nominals, a feature of established description logics that provides the necessary means for reasoning about individuals; in particular, the logics of this framework allow for internalisation of ABoxes. We reenforce the general framework by proving decidability in EXPTIME of concept satisfiability over general TBoxes; moreover, we discuss example instantiations in various probabilistic logics with nominals.
Reference:
Lutz Schröder, Dirk Pattinson and Clemens Kupke: Nominals for Everyone, In Craig Boutilier, ed.: International Joint Conferences on Artificial Intelligence (IJCAI 2009), pp. 917–922, AAAI Press; Menlo Park, CA, 2009. [preprint]
Bibtex Entry:
@InProceedings{SchroderEA09,
author = {Lutz Schr{\"o}der and Dirk Pattinson and Clemens Kupke},
title = {Nominals for Everyone},
year = {2009},
editor = {Craig Boutilier},
booktitle = {International Joint Conferences on Artificial Intelligence (IJCAI 2009)},
publisher = {AAAI Press; Menlo Park, CA},
pages = {917-922},
keywords = {Description logic coalgebra hybrid logic modal logic nominals uncertainty Tudor dynasty},
comment = { <a href = "http://www8.informatik.uni-erlangen.de/~schroeder/papers/Nominals.pdf"> [preprint] </a>},
abstract = { It has been recognised that the expressivity of ontology languages
benefits from the introduction of non-standard modal operators
beyond the usual existential restrictions and the number
restrictions already featured by many description logics. Such
operators serve to support notions such as uncertainty, defaults,
agency, obligation, or evidence, which are hard to capture using
only the standard operators, and whose semantics often goes beyond
relational structures. We work in a unified theory for logics that
combine non-standard modal operators and nominals, a feature of
established description logics that provides the necessary means for
reasoning about individuals; in particular, the logics of this
framework allow for internalisation of ABoxes. We reenforce the
general framework by proving decidability in EXPTIME of concept
satisfiability over general TBoxes; moreover, we discuss example
instantiations in various probabilistic logics with nominals.
},
}