Strategic Argumentation is NP-Complete.
Guido GovernatoriFrancesco OlivieriSimone ScannapiecoAntonino RotoloMatteo CristaniPublished in: ECAI (2014)
Keyphrases
- np complete
- randomly generated
- constraint satisfaction problems
- pspace complete
- np hard
- case study
- computational complexity
- knowledge management
- conjunctive queries
- satisfiability problem
- bounded treewidth
- decision making
- argumentation systems
- phase transition
- np complete problems
- polynomial time complexity
- argumentation semantics
- argumentation skills
- evidential reasoning
- defeasible reasoning
- neural network
- strategic planning
- agent communication
- capacity planning
- conp complete
- multi agent systems
- information systems