Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T10:30:28.910Z Has data issue: false hasContentIssue false

Relative expressiveness of defeasible logics II

Published online by Cambridge University Press:  25 September 2013

MICHAEL J. MAHER*
Affiliation:
School of Engineering and Information Technology, University of New South Wales, Canberra, ACT 2600, Australia (e-mail: m.maher@adfa.edu.au)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Maher (2012) introduced an approach for relative expressiveness of defeasible logics, and two notions of relative expressiveness were investigated. Using the first of these definitions of relative expressiveness, we show that all the defeasible logics in the DL framework are equally expressive under this formulation of relative expressiveness. The second formulation of relative expressiveness is stronger than the first. However, we show that logics incorporating individual defeat are equally expressive as the corresponding logics with team defeat. Thus the only differences in expressiveness of logics in DL arise from differences in how ambiguity is handled. This completes the study of relative expressiveness in DL begun in Maher (2012).

Supplementary material: PDF

Maher supplementary material

Appendix

Download Maher supplementary material(PDF)
PDF 280.7 KB