Efficient computation of argumentation semantics / Beishui Liao
- Liao, Beishui
- Oxford : Academic Press, 2014.
- Physical Description:
- 1 online resource (149 pages).
- Language Note:
- Half Title; Editorial Page; Title Page; Copyright; Contents; Preface; 1 Introduction; 1.1 Background; 1.2 The Notion of Argumentation; 1.3 Motivations of this Book; 1.4 The Structure of this Book; References; 2 Semantics of Argumentation; 2.1 Introduction; 2.2 Abstract Argumentation Frameworks; 2.3 Argumentation Semantics; 2.3.1 Extension-based Approach; 126.96.36.199 Admissible Extension; 188.8.131.52 Complete Extension; 184.108.40.206 Grounded Extension and Preferred Extension; 220.127.116.11 Stable Extension and Semi-Stable Extension; 18.104.22.168 Ideal Extension and Eager Extension; 2.3.2 Labelling-based Approach., 22.214.171.124 Admissible Labelling126.96.36.199 Complete Labelling; 188.8.131.52 Grounded Labelling and Preferred Labelling; 184.108.40.206 Stable Labelling and Semi-Stable Labelling; 220.127.116.11 Ideal Labelling and Eager Labelling; 2.3.3 Relations Between the Two Approaches; 2.3.4 Relations Between Different Semantics; 2.3.5 Status of Arguments; 2.4 Conclusions; References; 3 Existing Approaches for Computing Argumentation Semantics; 3.1 Introduction; 3.2 Approaches Based on Answer Set Programming; 3.2.1 Answer Set Programming; 18.104.22.168 Syntax; 22.214.171.124 Answer Set Semantics; 3.2.2 ASP for Argumentation., 3.3 Labelling-Based Algorithms3.3.1 The Computation of Grounded Labellings; 3.3.2 The Computation of Preferred Labellings; 126.96.36.199 Generating Admissible Labellings; 188.8.131.52 Generating Preferred Labellings; 3.4 Conclusions; References; 4 Sub-Frameworks and Local Semantics; 4.1 Introduction; 4.2 Notion of Sub-Frameworks; 4.2.1 Informal Idea; 4.2.2 Formal Definition; 4.2.3 Dependence Relation Between Different Sub-Frameworks; 4.3 Semantics of Sub-Frameworks; 4.3.1 Labellings of a Conditioned Sub-Framework; 4.3.2 Extensions of a Conditioned Sub-Framework., 4.4 Computation of the Semantics of a Sub-Framework4.5 Conclusions; References; 5 Relations between Global Semantics and Local Semantics; 5.1 Introduction; 5.2 Mapping Global Semantics to Local Semantics; 5.3 Mapping Local Semantics to Global Semantics; 5.3.1 Combining Extensions of Two Unconditioned Sub-Frameworks; 5.3.2 Combining Extensions of a Conditioned Sub-Framework and Those of an Unconditioned Sub-Framework; 5.3.3 Combining Labellings of Two Conditioned Sub-Frameworks; 5.4 Conclusions; References; 6 An Approach for Static Argumentation Frameworks; 6.1 Introduction., and 6.2 Decomposing an Argumentation Framework: A Layered Approach6.2.1 Strongly Connected Components of an Argumentation Framework; 6.2.2 A Decomposition Approach Based on SCCs; 6.3 An Incremental Approach to Compute Argumentation Semantics; 6.3.1 The Computation of Layer i (); 184.108.40.206 Constructing Partially Labelled Sub-Frameworks in Layer i (); 220.127.116.11 Computing the Labellings of Each Sub-Framework in Layer i (); 18.104.22.168 Horizontally Combining the Labellings of Layer i (); 22.214.171.124 Vertically Combining the Labellings of Layers from 0 to i ().
- Efficient Computation of Argumentation Semantics addresses argumentation semantics and systems, introducing readers to cutting-edge decomposition methods that drive increasingly efficient logic computation in AI and intelligent systems. Such complex and distributed systems are increasingly used in the automation and transportation systems field, and particularly autonomous systems, as well as more generic intelligent computation research. The Series in Intelligent Systems publishes titles that cover state-of-the-art knowledge and the latest advances in research and development.
- 9780124104068 (electronic bk.)
0124104061 (electronic bk.)
9780124104518 (electronic bk.)
0124104517 (electronic bk.)
- Bibliography Note:
- Includes bibliographical references and index.
View MARC record | catkey: 37431715