Conclusions and Future Work
Abstract
After having presented the theories and approaches for efficient computation of argumentation semantics, in this chapter, we conclude the book and point out six possible directions for further research.
Keywords
computational complexity; divide and conquer paradigm; efficient algorithms; local dynamics; local tractability
9.1 Conclusion
This book has presented fundamental theories for efficient computation of argumentation semantics. Under admissible, complete, preferred and grounded semantics, we have proved that the local semantics could be combined to form the global semantics, of an argumentation framework. The idea of local computation and global computation is somewhat similar to that of the ...
Get Efficient Computation of Argumentation Semantics now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
