Efficient Computation of Argumentation Semantics
- 1 Edición - 27 de diciembre de 2013
- Última edición
- Autor: Beishui Liao
- Idioma: Inglés
Efficient Computation of Argumentation Semantics addresses argumentation semantics and systems, introducing readers to cutting-edge decomposition methods that drive increasin… Leer más
Descripción
Descripción
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.
Puntos claves
Puntos claves
- 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
De interès para
De interès para
Electrical and Electronic Engineers; Mechanical Engineers; Computer Engineers; Intelligent Systems specialists.
Índice
Índice
Preface
Chapter 1. Introduction
Abstract
1.1 Background
1.2 The Notion of Argumentation
1.3 Motivations of this Book
1.4 The Structure of this Book
References
Chapter 2. Semantics of Argumentation
Abstract
2.1 Introduction
2.2 Abstract Argumentation Frameworks
2.3 Argumentation Semantics
2.4 Conclusions
References
Chapter 3. Existing Approaches for Computing Argumentation Semantics
Abstract
3.1 Introduction
3.2 Approaches Based on Answer Set Programming
3.3 Labelling-Based Algorithms
3.4 Conclusions
References
Chapter 4. Sub-Frameworks and Local Semantics
Abstract
4.1 Introduction
4.2 Notion of Sub-Frameworks
4.3 Semantics of Sub-Frameworks
4.4 Computation of the Semantics of a Sub-Framework
4.5 Conclusions
References
Chapter 5. Relations between Global Semantics and Local Semantics
Abstract
5.1 Introduction
5.2 Mapping Global Semantics to Local Semantics
5.3 Mapping Local Semantics to Global Semantics
5.4 Conclusions
References
Chapter 6. An Approach for Static Argumentation Frameworks
Abstract
6.1 Introduction
6.2 Decomposing an Argumentation Framework: A Layered Approach
6.3 An Incremental Approach to Compute Argumentation Semantics
6.4 Empirical Evaluation
6.5 Conclusions
References
Chapter 7. An Approach for Dynamic Argumentation Frameworks
Abstract
7.1 Introduction
7.2 The Changing of an Argumentation Framework
7.3 The Division of an Updated Argumentation Framework
7.4 Computing the Semantics of an Updated Argumentation Framework Based on the Division
7.5 An Illustrating Example
7.6 Conclusions
References
Chapter 8. An Approach for Partial Semantics of Argumentation
Abstract
8.1 Introduction
8.2 The Definition of Partial Semantics of Argumentation
8.3 Basic Properties of Partial Semantics of Argumentation
8.4 Empirical Investigation
8.5 Conclusions
References
Chapter 9. Conclusions and Future Work
Abstract
9.1 Conclusion
9.2 Future Work
References
Index
Detalles del producto
Detalles del producto
- Edición: 1
- Última edición
- Publicado: 14 de enero de 2014
- Idioma: Inglés
Sobre el autor
Sobre el autor
BL