资源分类
》 资源 》论文》On the Complexity of EL with Defeasible Inclusions? Piero A. Bonatti Marco Faella Luigi Sauro

On the Complexity of EL with Defeasible Inclusions? Piero A. Bonatti Marco Faella Luigi Sauro

2019-11-12 | |  55 |   40 |   0
Abstract We analyze the complexity of reasoning in EL with defeasible inclusions and extensions thereof. The results by Bonatti et al., 2009a are extended by proving tight lower complexity bounds and by relaxing the syntactic restrictions adopted there. We further extend the old framework by supporting arbitrary priority relations.

上一篇：RCC8 Is Polynomial on Networks of Bounded Treewidth Manuel Bodirsky Stefan Wo?l?

下一篇：Description Logics over Lattices with Multi-Valued Ontologies Stefan Borgwardt and Rafael Pen?aloza

用户评价
全部评价

热门资源

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Learning to learn...

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

  • A Mathematical Mo...

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