You are previewing Efficient Computation of Argumentation Semantics.
O'Reilly logo
Efficient Computation of Argumentation Semantics

Book Description

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 in intelligent systems. Its scope includes theoretical studies, design methods, and real-world implementations and applications. The series publishes titles in three core sub-topic areas: intelligent automation, intelligent transportation systems, and intelligent computing.



  • The first book to cover new methods for computing static, dynamic, and partial argumentation systems
  • Methods are applicable to development of systems and research areas in both AI and broader intelligent systems
  • Provides the AI and IS community with insight into the critical field of efficient computation, with a focus on intelligent automation, intelligent transportation systems, and intelligent computing

Table of Contents

  1. Cover image
  2. Title page
  3. Table of Contents
  4. Copyright
  5. Preface
  6. Chapter 1. Introduction
    1. Abstract
    2. 1.1 Background
    3. 1.2 The Notion of Argumentation
    4. 1.3 Motivations of this Book
    5. 1.4 The Structure of this Book
    6. References
  7. Chapter 2. Semantics of Argumentation
    1. Abstract
    2. 2.1 Introduction
    3. 2.2 Abstract Argumentation Frameworks
    4. 2.3 Argumentation Semantics
    5. 2.4 Conclusions
    6. References
  8. Chapter 3. Existing Approaches for Computing Argumentation Semantics
    1. Abstract
    2. 3.1 Introduction
    3. 3.2 Approaches Based on Answer Set Programming
    4. 3.3 Labelling-Based Algorithms
    5. 3.4 Conclusions
    6. References
  9. Chapter 4. Sub-Frameworks and Local Semantics
    1. Abstract
    2. 4.1 Introduction
    3. 4.2 Notion of Sub-Frameworks
    4. 4.3 Semantics of Sub-Frameworks
    5. 4.4 Computation of the Semantics of a Sub-Framework
    6. 4.5 Conclusions
    7. References
  10. Chapter 5. Relations between Global Semantics and Local Semantics
    1. Abstract
    2. 5.1 Introduction
    3. 5.2 Mapping Global Semantics to Local Semantics
    4. 5.3 Mapping Local Semantics to Global Semantics
    5. 5.4 Conclusions
    6. References
  11. Chapter 6. An Approach for Static Argumentation Frameworks
    1. Abstract
    2. 6.1 Introduction
    3. 6.2 Decomposing an Argumentation Framework: A Layered Approach
    4. 6.3 An Incremental Approach to Compute Argumentation Semantics
    5. 6.4 Empirical Evaluation
    6. 6.5 Conclusions
    7. References
  12. Chapter 7. An Approach for Dynamic Argumentation Frameworks
    1. Abstract
    2. 7.1 Introduction
    3. 7.2 The Changing of an Argumentation Framework
    4. 7.3 The Division of an Updated Argumentation Framework
    5. 7.4 Computing the Semantics of an Updated Argumentation Framework Based on the Division
    6. 7.5 An Illustrating Example
    7. 7.6 Conclusions
    8. References
  13. Chapter 8. An Approach for Partial Semantics of Argumentation
    1. Abstract
    2. 8.1 Introduction
    3. 8.2 The Definition of Partial Semantics of Argumentation
    4. 8.3 Basic Properties of Partial Semantics of Argumentation
    5. 8.4 Empirical Investigation
    6. 8.5 Conclusions
    7. References
  14. Chapter 9. Conclusions and Future Work
    1. Abstract
    2. 9.1 Conclusion
    3. 9.2 Future Work
    4. References
  15. Index