For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

University of Huddersfield

Return to search Previous output Next output
Output 6 of 54 in the submission
Article title

An inclusion theorem for defeasible logics

Type
D - Journal article
Title of journal
ACM Transactions on Computational Logic
Article number
-
Volume number
12
Issue number
1
First page of article
6
ISSN of journal
1557-945X
Year of publication
2010
Number of additional authors
3
Additional information

<22>This paper is the culmination of a research effort to understand the various defeasible logic variants, and their relative reasoning power. The main result shows that most variants form a chain of increasing reasoning power. Such a result is important for (a) understanding the merits of different variants; (b) supporting reasoning with different “modes”, where provability in one mode implies provability in another. Moreover, the result is indicative of the relative strengths of reasoning modes in other logics. TOCL is among the top journals in the area of knowledge representation and reasoning.

Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
6
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-