The Complexity of the Warranted Formula Problem in Propositional Argumentation

DOI10.1093/logcom/exp074zbMath1200.68225OpenAlexW2009780046MaRDI QIDQ3553918

Nikos Gorogiannis, Robin Hirschl

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

complexitypropositional logicargumentationwarranted formula problem

Mathematics Subject Classification ID

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

Related Items (2)

Complexity Classifications for Logic-Based Argumentation ⋮ Computational complexity of flat and generic assumption-based argumentation, with and without probabilities

This page was built for publication: The Complexity of the Warranted Formula Problem in Propositional Argumentation