ON THE ACCEPTABILITY OF ARGUMENTS AND ITS FUNDAMENTAL ROLE IN NONMONOTONIC REASONING, LOGIC PROGRAMMING AND N-PERSON GAMES
ON THE ACCEPTABILITY OF ARGUMENTS AND ITS FUNDAMENTAL ROLE IN NONMONOTONIC REASONING, LOGIC PROGRAMMING AND N-PERSON GAMES
复制标题
DOI：
10.1016/0004-3702(94)00041-x
复制
发表时间：
1995-09-01
影响因子：
14.4
通讯作者：
DUNG, PM
中科院分区：
文献类型：
--
作者：
DUNG, PM
本文的目的是研究人类在论证中使用的基本机制，并探索在计算机上实现这一机制的方法。我们首先发展了一种论证理论，其核心概念是论点的可接受性。然后，我们用两个强有力的论据来论证我们的理论的“正确性”或“适当性”。第一种方法表明，人工智能和逻辑编程中的大多数非单调推理的主要方法都是我们的论证理论的特殊形式。第二个论点说明了我们的理论如何可以用来研究许多实际问题的逻辑结构。这一结果表明我们的理论自然地捕捉到了n人博弈理论和众所周知的稳定婚姻问题的解。通过证明论证可以被视为以否定为失败的逻辑编程的一种特殊形式，我们引入了一种基于逻辑编程的通用方法来生成用于论证系统的元解释器，该方法与传统编程中的编译器-编译器的思想非常相似。
The purpose of this paper is to study the fundamental mechanism, humans use in argumentation, and to explore ways to implement this mechanism on computers.We do so by first developing a theory for argumentation whose central notion is the acceptability of arguments. Then we argue for the ''correctness'' or ''appropriateness'' of our theory with two strong arguments. The first one shows that most of the major approaches to nonmonotonic reasoning in AI and logic programming are special forms of our theory of argumentation. The second argument illustrates how our theory can be used to investigate the logical structure of many practical problems. This argument is based on a result showing that our theory captures naturally the solutions of the theory of n-person games and of the well-known stable marriage problem.By showing that argumentation can be viewed as a special form of logic programming with negation as failure, we introduce a general logic-programming-based method for generating meta-interpreters for argumentation systems, a method very much similar to the compiler-compiler idea in conventional programming.