UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

The Complexity of the Warranted Formula Problem in Propositional Argumentation

Hirsch, R; Gorogiannis, N; (2010) The Complexity of the Warranted Formula Problem in Propositional Argumentation. JOURNAL OF LOGIC AND COMPUTATION , 20 (2) 481 - 499. 10.1093/logcom/exp074.

Full text not available from this repository.
Type: Article
Title: The Complexity of the Warranted Formula Problem in Propositional Argumentation
DOI: 10.1093/logcom/exp074
Keywords: Argumentation, propositional logic, complexity, warranted formula problem
UCL classification: UCL > School of BEAMS > Faculty of Engineering Science > Computer Science
URI: http://discovery.ucl.ac.uk/id/eprint/174935
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item