Tech Reports

ULCS-04-009

Complexity in Value-Based Argument Systems

Paul E. Dunne and Trevor Bench-Capon

Abstract

We consider a number of decision problems formulated in
value-based argumentation frameworks (VAFs), a development of Dung's argument
systems in which arguments have associated abstract values which are considered relative
to the orderings induced by the opinions of specific audiences. In the context of a single fixed
audience, it is known that those decision questions which are typically computationally
hard in the standard setting admit efficient solution methods in the value-based setting.
In this paper we show that, in spite of this positive property, there still remain a number
of natural questions that arise solely in value-based schemes for which there are unlikely to
be efficient decision processes.

For each technical report listed here, copyright and all intellectual property rights remain with the respective authors. Copyright is effective from the year of publication in each case. By downloading a file from this page, you agree to use it only for purposes of research and scholarship. Any other use of this material or storage of it in any medium or its sale or distribution in any form is expressly forbidden without prior written permission from the authors concerned.