资源分类
》 资源 》论文》Combining DL-LiteN bool with Branching Time: A gentle Marriage

Combining DL-LiteN bool with Branching Time: A gentle Marriage

2019-10-29 | |  41 |   36 |   0
Abstract We study combinations of the description logic DLLiteN boolwith the branching temporal logics CTL? and CTL. We analyse two types of combinations, both with rigid roles: (i) temporal operators are applied to concepts and ABox assertions, and (ii) temporal operators are applied to concepts and Boolean combinations of concept inclusions and ABox assertions. For the resulting logics, we present algorithms for the satisfiability problem and (mostly tight) complexity bounds ranging from EXPTIME to 3EXPTIME

上一篇：Causal Discovery from Nonstationary/Heterogeneous Data: Skeleton Estimation and Orientation Determination

下一篇：Conflict-driven ASP Solving with External Sources and Program Splits

用户评价
全部评价

热门资源

  • 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...

  • Learning to learn...

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

  • A Mathematical Mo...

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