Vidal's library
Title: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
Author: Phan Minh Dung
Journal: Artificial Intelligence
Volume: 77
Number: 2
Pages: 321--357
Year: 1995
DOI: 10.1016/0004-3702(94)00041-X
Abstract: 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.

Cited by 397  -  Google Scholar

@Article{dung95a,
  author =	 {Phan Minh Dung},
  title =	 {On the acceptability of arguments and its
                  fundamental role in nonmonotonic reasoning, logic
                  programming and n-person games},
  journal =	 {Artificial Intelligence},
  year =	 1995,
  volume =	 77,
  number =	 2,
  pages =	 {321--357},
  abstract =	 {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. },
  doi = 	 {10.1016/0004-3702(94)00041-X},
  url = 	 {http://jmvidal.cse.sc.edu/library/dung95a.pdf},
  cluster = 	 {2043080667910285818},
  keywords = 	 {argumentation}
}
Last modified: Wed Mar 9 10:14:04 EST 2011