Complexity classifications for logic-based argumentation
N Creignou, U Egly, J Schmidt - ACM Transactions on Computational …, 2014 - dl.acm.org
We consider logic-based argumentation in which an argument is a pair (Φ, α), where the
support Φ is a minimal consistent set of formulae taken from a given knowledge base …
support Φ is a minimal consistent set of formulae taken from a given knowledge base …