O'Reilly logo

Efficient Computation of Argumentation Semantics by Beishui Liao

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Chapter 9

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 ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required