Reference : Arbitrary Ranking of Defeasible Subsumption |
Scientific congresses, symposiums and conference proceedings : Paper published in a book | |||
Engineering, computing & technology : Computer science | |||
Computational Sciences | |||
http://hdl.handle.net/10993/39647 | |||
Arbitrary Ranking of Defeasible Subsumption | |
English | |
Casini, Giovanni ![]() | |
Harrison, Michael ![]() | |
Meyer, Thomas ![]() | |
Swan, Reid ![]() | |
2019 | |
Proceedings of the 32nd International Workshop on Description Logics | |
CEUR | |
CEUR Workshop Proceedings, Vol. 2373 | |
Yes | |
No | |
International | |
32nd International Workshop on Description Logics (DL 2019) | |
18-21 June 2019 | |
Oslo | |
Norway | |
[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. | |
Researchers | |
http://hdl.handle.net/10993/39647 | |
http://ceur-ws.org/Vol-2373/ | |
H2020 ; 690974 - MIREL - MIREL - MIning and REasoning with Legal texts |
File(s) associated to this reference | ||||||||||||||
Fulltext file(s):
| ||||||||||||||
All documents in ORBilu are protected by a user license.