资源分类
》 资源 》论文》Defeasible Inheritance-Based Description Logics Giovanni Casini Umberto Straccia

Defeasible Inheritance-Based Description Logics Giovanni Casini Umberto Straccia

2019-11-12 | |  47 |   53 |   0
Abstract Defeasible inheritance networks are a nonmonotonic framework that deals with hierarchical knowledge. On the other hand, rational closure is acknowledged as a landmark of the preferential approach. We will combine these two approaches and de?ne a new non-monotonic closure operation for propositional knowledge bases that combines the advantages of both. Then we rede?ne such a procedure for Description Logics, a family of logics well-suited to model structured information. In both cases we will provide a simple reasoning method that is build on top of the classical entailment relation.

上一篇：Containment of Regular Path Queries under Description Logic Constraints?

下一篇：SDD: A New Canonical Representation of Propositional Knowledge Bases

用户评价
全部评价

热门资源

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...