The complexity of the warranted formula problem in propositional argumentation

DOI10.1093/LOGCOM/EXP074MaRDI QIDQ3553918zbMATH OpenOpenAlexFDO

Authors Nikos Gorogiannis, Robin Hirsch

Publication date 21 April 2010

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/42b95efa29aa08db80b4418300967a8d5bc61f17

zbMATH Keywords

argumentationcomplexitypropositional logicwarranted formula problem

Mathematics Subject Classification ID

Classical propositional logic (03B05) Logic in artificial intelligence (68T27)

Recommendations

• Complexity Classifications for Logic-Based Argumentation
• On the computational complexity of assumption-based argumentation for default reasoning.
• Encoding deductive argumentation in quantified Boolean formulae
• Complexity of abstract argumentation under a claim-centric view
• On computing the set of acceptable arguments in abstract argumentation

Cited in

(3)

• Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
• Complexity Classifications for Logic-Based Argumentation
• Sets of Boolean connectives that make argumentation easier

This page was built for publication: The complexity of the warranted formula problem in propositional argumentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3553918)