辩论推理系统的语义计算

Introduction

1.1 Background

1.2 The Notion of Argumentation

1.3 Motivations of This Book

1.4 The Structure of This Book

References

Semantics of Argumentation

2.1 Introduction

2.2 Abstract Argumentation Frameworks

2.3 Argumentation Emantics

2.3.1 Extension-Based Approach

2.3.2 Labelling-Based Approach

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

Existing Approaches for Computing Argumentation Semantics

3.1 Introduction

3.2 Approaches Based on Answer-Set Programming

3.2.1 Answer-Set Programming

3.2.2 ASP for Argumentation

3.3 Labelling-Based Algorithms

3.3.1 The Computation of Grounded Labelling

3.3.2 The Computation of Preferred Labellings

3.4 Conclusions

References

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

4.5 Conclusions

References

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

An Approach for Static Argumentation Frameworks

6.1 Introduction

6.2 Decomposing an Argumentation Framework: a Layered Approach

6.2.1 Strongly Connected Components (SCCs) 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 (0 ＜ i _＜/max)

6.3.2 Soundness and Completeness of Semantic Combination

6.3.3 An Illustrating Example

6.4 Empirical Evaluation

6.5 Conclusions

References

An Approach for Dynamic Argumentation Frameworks

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

An Approach for Partial Semantics of Argumentation

8.1 Introduction

8.2 The Definition of Partial Semantics of Argumentation

8.3 Basic Properties of Partial Semantics of Argumentation

8.3.1 Monotonicity of Partial Semantics

8.3.2 Extensibility of Partial Semantics

8.3.3 Combinability of Partial Semantics

8.4 Empirical Investigation

8.5 Conclusions

References

Conclusions and Future Work

9.1 Conclusions

9.2 Future Work

References

Index

本书中我们提出3种不同的辩论语义计算的新颖方法(computing the semantics of a static argumentation system, computing the semantics of a dynamic argumentation system, and computing the partial semantics of an argumentation system)。证明了这些方法是非常有效的。由于与辩论可接受度有关的许多问题的计算不可实现性，本书中提出的新方法为该领域今后的发展奠定了坚实基础，因此对于该领域内的研究人员有着非同寻常的吸引力和兴趣。