Hostname: page-component-77c78cf97d-sp94z Total loading time: 0 Render date: 2026-05-02T11:51:17.999Z Has data issue: false hasContentIssue false

A review of current defeasible reasoning implementations

Published online by Cambridge University Press:  01 September 2008

DANIEL BRYANT
Affiliation:
Department of Computing, University of Surrey, Guildford, Surrey, UK; e-mail: d.bryant@surrey.ac.uk, p.krause@surrey.ac.uk
PAUL KRAUSE
Affiliation:
Department of Computing, University of Surrey, Guildford, Surrey, UK; e-mail: d.bryant@surrey.ac.uk, p.krause@surrey.ac.uk

Abstract

This article surveys existing practical implementations of both defeasible and argumentation-based reasoning engines and associated literature. We aim to summarize the current state of the art in the research area, show that there are many similiarities and connections between the various implementations and also highlight the differences regarding evaluation goals and strategies. An important goal of this paper is to argue for the need for well-designed empirical evaluations, as well as formal complexity analysis, in order to justify the practical applicability of a reasoning engine. There are indeed many challenges to be faced in developing implementations of argumentation. Not least of these is the inherent computational complexity of the formal models. We cover some of the ways these challenges have been addressed, and provide pointers for future directions in realizing the goal of practical argumentation.

Information

Type
Articles
Copyright
Copyright © Cambridge University Press 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable