Which are the True Defeasible Logics?
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911892445855744 |
|---|---|
| author | Maher, Michael J. |
| author_facet | Maher, Michael J. |
| contents | The class of defeasible logics is only vaguely defined -- it is defined by a few exemplars and the general idea of efficient reasoning with defeasible rules. The recent definition of the defeasible logic $DL(\partial_{||})$ introduced new features to such logics, which have repercussions that we explore. In particular, we define a class of logics that accommodates the new logic while retaining the traditional properties of defeasible logics. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_19157 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Which are the True Defeasible Logics? Maher, Michael J. Logic in Computer Science 03B70, 03B60, 68T27 I.2.3; I.2.4; F.4.1 The class of defeasible logics is only vaguely defined -- it is defined by a few exemplars and the general idea of efficient reasoning with defeasible rules. The recent definition of the defeasible logic $DL(\partial_{||})$ introduced new features to such logics, which have repercussions that we explore. In particular, we define a class of logics that accommodates the new logic while retaining the traditional properties of defeasible logics. |
| title | Which are the True Defeasible Logics? |
| topic | Logic in Computer Science 03B70, 03B60, 68T27 I.2.3; I.2.4; F.4.1 |
| url | https://arxiv.org/abs/2405.19157 |