Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation | Zendy

Johannes Wallner | Zendy; Andreas Niskanen | Zendy; Matti Järvisalo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation

Author(s) -

Johannes Wallner,

Andreas Niskanen,

Matti Järvisalo

Publication year - 2016

Publication title -

proceedings of the aaai conference on artificial intelligence

Language(s) - English

Resource type - Journals

eISSN - 2374-3468

pISSN - 2159-5399

DOI - 10.1609/aaai.v30i1.10101

Subject(s) - argumentation theory , polynomial hierarchy , extension (predicate logic) , generality , computer science , argument (complex analysis) , enforcement , counterexample , completeness (order theory) , theoretical computer science , computational complexity theory , semantics (computer science) , hierarchy , time complexity , algorithm , programming language , mathematics , discrete mathematics , psychology , mathematical analysis , philosophy , biochemistry , chemistry , epistemology , political science , economics , law , market economy , psychotherapist

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research