The complexity of the warranted formula problem in propositional argumentation

Gorogiannis, Nikos and Hirsch, Robin (2010) The complexity of the warranted formula problem in propositional argumentation. Journal of Logic and Computation, 20 (2). pp. 481-499. ISSN 0955-792X (doi:10.1093/logcom/exp074)

Full text is not in this repository.

Abstract

The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive defeat: an argument is warranted if each of its counter-arguments is itself defeated by a warranted counter-argument. However, few complexity results exist on checking whether an argument is warranted in the context of deductive models of argumentation, i.e. models where an argument is a deduction of a claim from a set of premises using some logic. We investigate the computational complexity of checking whether a claim is warranted in propositional argumentation under two natural definitions of warrant and show that it is PSPACE-complete in both cases.

Item Type: Article
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 12087
Depositing User: Users 3197 not found.
Date Deposited: 30 Sep 2013 09:54
Last Modified: 13 Oct 2016 14:28
URI: https://eprints.mdx.ac.uk/id/eprint/12087

Actions (login required)

Edit Item Edit Item