资源分类
》 资源 》论文》Defeasible Inclusions in Low-Complexity DLs: Preliminary Notes

Defeasible Inclusions in Low-Complexity DLs: Preliminary Notes

2019-11-15 | |  55 |   34 |   0

Abstract We analyze the complexity of reasoning with circumscribed low-complexity DLs such as DL-lite and the EL family, under suitable restrictions on the use of abnormality predicates. We prove that in circumscribed DL-liteR complexity drops from NExpNP to the second level of the polynomial hierarchy. In EL, reasoning remains ExpTime-hard, in general. However, by restricting the possible occurrences of existential restrictions, we obtain membership in Σp2 and Πp2 for an extension of EL

上一篇：An Argumentation-Based Interpreter for Golog Programs

下一篇：Next Steps in Propositional Horn Contraction

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...