图书介绍
辩论推理系统的语义计算 英文版PDF|Epub|txt|kindle电子书版本网盘下载
- 廖备水著 著
- 出版社： 杭州：浙江大学出版社
- ISBN：9787308143257
- 出版时间：2015
- 标注页数：144页
- 文件大小：15MB
- 文件页数：154页
- 主题词：辩论－推理－言语统计－研究－英文
PDF下载
下载说明
辩论推理系统的语义计算 英文版PDF格式电子书版下载
下载的文件为RAR压缩包。需要使用解压软件进行解压得到PDF格式图书。建议使用BT下载工具Free Download Manager进行下载,简称FDM(免费,没有广告,支持多平台）。本站资源全部打包为BT种子。所以需要使用专业的BT下载软件进行下载。如BitComet qBittorrent uTorrent等BT下载工具。迅雷目前由于本站不是热门资源。不推荐使用！后期资源热门了。安装了迅雷也可以迅雷进行下载！
（文件页数 要大于 标注页数，上中下等多册电子书除外）
注意：本站所有压缩包均有解压码： 点击下载压缩包解压工具
图书目录
1 Introduction1
1.1 Background1
1.2 The Notion of Argumentation2
1.3 Motivations of This Book4
1.4 The Structure of This Book6
References7
2 Semantics of Argumentation9
2.1 Introduction9
2.2 Abstract Argumentation Frameworks10
2.3 Argumentation Emantics10
2.3.1 Extension-Based Approach11
2.3.2 Labelling-Based Approach17
2.3.3 Relations Between the Two Approaches21
2.3.4 Relations Between Difierent Semantics22
2.3.5 Status of Arguments22
2.4 Conclusions24
References25
3 Existing Approaches for Computing Argumentation Semantics27
3.1 Introduction27
3.2 Approaches Based on Answer-Set Programming28
3.2.1 Answer-Set Programming28
3.2.2 ASP for Argumentation29
3.3 Labelling-Based Algorithms32
3.3.1 The Computation of Grounded Labelling32
3.3.2 The Computation of Preferred Labellings33
3.4 Conclusions36
References37
4 Sub-Frameworks and Local Semantics39
4.1 Introduction39
4.2 Notion of Sub-Frameworks40
4.2.1 Informal Idea40
4.2.2 Formal Definition41
4.2.3 Dependence Relation Between Different Sub-Frameworks43
4.3 Semantics of Sub-Frameworks44
4.3.1 Labellings of a Conditioned Sub-Framework44
4.3.2 Extensions of a Conditioned Sub-Framework47
4.4 Computation of the Semantics of a Sub-Framework50
4.5 Conclusions53
References53
5 Relations Between Global Semantics and Local Semantics55
5.1 Introduction55
5.2 Mapping Global Semantics to Local Semantics57
5.3 Mapping Local Semantics to Global Semantics60
5.3.1 Combining Extensions of Two Unconditioned Sub-Frameworks61
5.3.2 Combining Extensions of a Conditioned Sub-Framework and Those of an Unconditioned Sub-Framework63
5.3.3 Combining Labellings of Two Conditioned Sub-Frameworks69
5.4 Conclusions72
References72
6 An Approach for Static Argumentation Frameworks73
6.1 Introduction73
6.2 Decomposing an Argumentation Framework:a Layered Approach75
6.2.1 Strongly Connected Components(SCCs)of an Argumentation Framework76
6.2.2 A Decomposition Approach Based on SCCs76
6.3 An Incremental Approach to Compute Argumentation Semantics81
6.3.1 The Computation ofLayer i(0≤i≤lmax)81
6.3.2 Soundness and Completeness of Semantic Combination84
6.3.3 An Illustrating Example85
6.4 Empirical Evaluation89
6.5 Conclusions96
References98
7 An Approach for Dynamic Argumentation Frameworks101
7.1 Introduction101
7.2 The Changing of an Argumentation Framework105
7.3 The Division of an Updated Argumentation Framework106
7.4 Computing the Semantics of an Updated Argumentation Framework Based on the Division111
7.5 An Illustrating Example112
7.6 Conclusions114
References116
8 An Approach for Partial Semantics of Argumentation119
8.1 Introduction119
8.2 The Definition of Partial Semantics of Argumentation121
8.3 Basic Properties of Partial Semantics of Argumentation124
8.3.1 Monotonicity of Partial Semantics125
8.3.2 Extensibility of PartiaI Semantics125
8.3.3 Combinability of Partial Semantics128
8.4 Empirical Investigation129
8.5 Conclusions134
References135
9 Conclusions and Future Work137
9.1 Conclusions137
9.2 Future Work138
References139
Index141