Reference : Taking Defeasible Entailment beyond Rational Closure
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Computational Sciences
http://hdl.handle.net/10993/39594
Taking Defeasible Entailment beyond Rational Closure
English
Casini, Giovanni mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Meyer, Thomas mailto [University of Cape Town > Computer Science]
Varzinczak, Ivan mailto [Université d'Artois > Computer Science]
2019
Proceedings of the 16th European Conference on Logics in Artificial Intelligence (JELIA-19)
Springer
LNCS 11468
Yes
No
International
978-3-030-19570-0
16th European Conference on Logics in Artificial Intelligence (JELIA-19)
7-11 May 2019
Rende
Italy
[en] artificial intelligence ; knowledge representation ; nonmonotonic logics
[en] We present a systematic approach for extending the KLM framework
for defeasible entailment. We first present a class of basic defeasible entailment
relations, characterise it in three distinct ways and provide a high-level algorithm
for computing it. This framework is then refined, with the refined version being
characterised in a similar manner. We show that the two well-known forms of
defeasible entailment, rational closure and lexicographic closure, fall within our
refined framework, that rational closure is the most conservative of the defeasible
entailment relations within the framework (with respect to subset inclusion), but
that there are forms of defeasible entailment within our framework that are more
“adventurous” than lexicographic closure.
Researchers
http://hdl.handle.net/10993/39594
10.1007/978-3-030-19570-0
H2020 ; 690974 - MIREL - MIREL - MIning and REasoning with Legal texts

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
JELIA-2019-repository.pdfAuthor preprint298.58 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.