Reference : Arbitrary Ranking of Defeasible Subsumption
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Computational Sciences
Arbitrary Ranking of Defeasible Subsumption
Casini, Giovanni mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Harrison, Michael mailto [University of Cape Town > Computer Science]
Meyer, Thomas mailto [University of Cape Town > Computer Science]
Swan, Reid mailto [University of Cape Town > Computer Science]
Proceedings of the 32nd International Workshop on Description Logics
CEUR Workshop Proceedings, Vol. 2373
32nd International Workshop on Description Logics (DL 2019)
18-21 June 2019
[en] Description logics ; Defeasible Reasoning
[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.
H2020 ; 690974 - MIREL - MIREL - MIning and REasoning with Legal texts

File(s) associated to this reference

Fulltext file(s):

Open access
paper-9.pdfPublisher postprint547.46 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.