Casini, Giovanni and Meyer, Thomas and Varzinczak, Ivan (2019) Taking Defeasible Entailment Beyond Rational Closure, Logics in Artificial Intelligence 16th European Conference, JELIA 2019 Rende, Italy, May 7–11, 2019 Proceedings, LNAI, 11468, Springer.
![[img]](http://pubs.cs.uct.ac.za/style/images/fileicons/text.png) |
Text
2019-JELIA-Casini-ea.pdf Download (21MB) |
Abstract
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.
| Item Type: | Book chapter |
|---|---|
| Subjects: | Computing methodologies > Artificial intelligence > Knowledge representation and reasoning |
| Date Deposited: | 15 Jan 2020 11:30 |
| Last Modified: | 15 Jan 2020 11:30 |
| URI: | http://pubs.cs.uct.ac.za/id/eprint/1367 |
Actions (login required)
 |
View Item |