Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(1)
Computational Complexity
Subscribe
Academic
Publications
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The Complexity of the Warranted Formula Problem in Propositional Argumentation,10.1093/logcom/exp074,Journal of Logic and Computation,Robin Hirsch,Nik
Edit
The Complexity of the Warranted Formula Problem in Propositional Argumentation
(
Citations: 4
)
BibTex

RIS

RefWorks
Download
Robin Hirsch
,
Nikos Gorogiannis
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 counterarguments is itself defeated by a warranted counterargument. 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 PSPACEcomplete in both cases.
Journal:
Journal of Logic and Computation  LOGCOM
, vol. 20, no. 2, pp. 481499, 2010
DOI:
10.1093/logcom/exp074
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.informatik.unitrier.de
)
(
logcom.oxfordjournals.org
)
(
dx.doi.org
)
(
www.cs.ucl.ac.uk
)
More »
Citation Context
(2)
...The complexity of ArgRel is a computational core for evaluating more complex argumentation problems, for instance, the warranted formula problem (WFP) on argument trees, which has recently been shown to be PSPACEcomplete [
HG10
]...
Nadia Creignou
,
et al.
Sets of Boolean Connectives That Make Argumentation Easier
...It is worth noticing that in a recent work [
18
], the authors have studied the complexity of the warranted formula problem in a framework for propositional argumentation with classical logic and general formulae (not only horn clauses), and they have shown the problem to be PSPACEcomplete...
Teresa Alsinet
,
et al.
A Computational Method for Defeasible Argumentation Based on a Recursi...
References
(21)
An Abstract, ArgumentationTheoretic Approach to Default Reasoning
(
Citations: 220
)
Andrei Bondarenko
,
Phan Minh Dung
,
Robert A. Kowalski
,
Francesca Toni
Journal:
Artificial Intelligence  AI
, vol. 93, no. 12, pp. 63101, 1997
Towards a LogicBased Theory of Argumentation
(
Citations: 10
)
Philippe Besnard
,
Anthony Hunter
Conference:
National Conference on Artificial Intelligence  AAAI
, pp. 411416, 2000
Encoding deductive argumentation in quantified Boolean formulae
(
Citations: 4
)
Philippe Besnard
,
Anthony Hunter
,
Stefan Woltran
Journal:
Artificial Intelligence  AI
, vol. 173, no. 15, pp. 14061423, 2009
Preferred Arguments are Harder to Compute than Stable Extension
(
Citations: 19
)
Yannis Dimopoulos
,
Bernhard Nebel
,
Francesca Toni
Conference:
International Joint Conference on Artificial Intelligence  IJCAI
, pp. 3643, 1999
Finding Admissible and Preferred Arguments Can be Very Hard
(
Citations: 20
)
Yannis Dimopoulos
,
Bernhard Nebel
,
Francesca Toni
Conference:
Principles of Knowledge Representation and Reasoning  KR
, pp. 5361, 2000
Sort by:
Citations
(4)
Algorithms for generating arguments and counterarguments in propositional logic
(
Citations: 1
)
Vasiliki Efstathiou
,
Anthony Hunter
Journal:
International Journal of Approximate Reasoning  IJAR
, vol. 52, no. 6, pp. 672704, 2011
Complexity of logicbased argumentation in Post's framework
Nadia Creignou
,
Johannes Schmidt
,
Michael Thomas
,
Stefan Woltran
Journal:
Argument & Computation
, vol. 2, no. 23, pp. 107129, 2011
Sets of Boolean Connectives That Make Argumentation Easier
Nadia Creignou
,
Johannes Schmidt
,
Michael Thomas
,
Stefan Woltran
Conference:
Logics in Artificial Intelligence  JELIA
, pp. 117129, 2010
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics
Teresa Alsinet
,
Ramón Béjar
,
Lluis Godo
Conference:
IberoAmerican Conference on AI  IBERAMIA
, pp. 4049, 2010