资源论文Nominals for Everyone

Nominals for Everyone

2019-11-14 | |  33 |   33 |   0

Abstract It has been recognised that the expressivity of description logics benefifits 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 unifified 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 satisfifiability over general TBoxes, which instantiates to novel upper bounds for many individual logics including probabilistic logic with nominals

上一篇:Model-based Revision Operators for Terminologies in Description Logics

下一篇:Efficient Inference for Expressive Comparative Preference Languages

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Learning to learn...

    The move from hand-designed features to learned...