Abstract :
[en] In this paper we propose an algorithm that generalises existing procedures for the implementation of defeasible reasoning in the framework of Description Logics (DLs). One of the well-known approaches
to defeasible reasoning, the so-called KLM approach, is based on constructing specific rankings of defeasible information, and using these rankings to determine priorities in case of conflicting information. Here we propose a procedure that allows us to input any possible ranking of
the defeasible concept inclusions contained in the knowledge base. We analyse and investigate the forms of defeasible reasoning obtained when conclusions drawn are obtained using these rankings.
Scopus citations®
without self-citations
0