On the Computational Complexity of Naive-Based Semantics for Abstract Dialectical Frameworks.
Sarah Alice GagglSebastian RudolphHannes StrassPublished in: IJCAI (2015)
Keyphrases
- computational complexity
- abstract argumentation frameworks
- defeasible reasoning
- argumentation frameworks
- np complete
- argumentation systems
- formal semantics
- desirable properties
- decision problems
- propositional dynamic logic
- high computational complexity
- semantic information
- low complexity
- logic programming
- graphical representation
- computational cost
- computational efficiency
- low level
- argumentation semantics
- storage requirements
- knowledge representation
- operational semantics
- np hard
- special case
- relational databases
- high level