返回
摘要
En 中文
In this paper, we develop a theory of abstract argumentation systems. An abstract argumentation system is a collection of ''defeasible proofs'', called arguments, that is partially ordered by a relation expressing the difference in conclusive force. The prefix ''abstract'' indicates that the theory is concerned neither with a specification of the underlying language, nor with the development of a subtheory that explains the partial order. An unstructured language, without logical connectives such as negation, makes arguments not (pairwise) inconsistent, but (groupwise) incompatible, Incompatibility and difference in conclusive force cause defeat among arguments. The aim of the theory is to find out which arguments eventually emerge undefeated. These arguments are considered to be in force, Several results are established. The main result is that arguments that are in force are precisely those that are in the limit of a so-called complete argumentation sequence. (C) 1997 Elsevier Science B.V.
Keyword:
nonmonotonic logic
defeasible reasoning
argumentation
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
暂无机构信息
引用论文
Quantitative Evaluation in Estimating Sources Underlying Brain Oscillations Using Current Source Density Methods and Beamformer Approaches
eneuro
IF0
The genome sequence of the rice blast fungus Magnaporthe grisea稻瘟病菌Magnaporthe grisea的基因组序列
Nature
IF0
Retention and Recovery of Habituated Territorial Aggressive Behavior in the Three-Spined Stickleback (Gasterosteus Aculeat Us L.) : the Roles of Time and Nest Reconstruction
Behaviour
IF0

