Strategic Argumentation is NP-Complete.
Guido GovernatoriFrancesco OlivieriSimone ScannapiecoAntonino RotoloMatteo CristaniPublished in: CoRR (2013)
Keyphrases
- np complete
- randomly generated
- satisfiability problem
- np hard
- computational complexity
- argumentation semantics
- conjunctive queries
- defeasible reasoning
- constraint satisfaction problems
- case study
- pspace complete
- polynomial time complexity
- decision making
- knowledge management
- argumentation systems
- bounded treewidth
- capacity planning
- np complete problems
- argumentation skills
- phase transition
- strategic planning
- practical reasoning
- evidential reasoning
- content analysis