Preference-based argumentation: Arguments supporting multiple values (bibtex)
by Souhila Kaci, Leendert van der Torre
Abstract:
In preference-based argumentation theory, an argument may be preferred to another one when, for example, it is more specific, its beliefs have a higher probability or certainty, or it promotes a higher value. In this paper we generalize Bench-Capon's value-based argumentation theory such that arguments can promote multiple values, and preferences among values or arguments can be specified in various ways. We assume in addition that there is default knowledge about the preferences over the arguments, and we use an algorithm to derive the most likely preference order. In particular, we show how to use non-monotonic preference reasoning to compute preferences among arguments, and subsequently the acceptable arguments, from preferences among values. We show also how the preference ordering can be used to optimize the algorithm to construct the grounded extension by proceeding from most to least preferred arguments.
Reference:
Preference-based argumentation: Arguments supporting multiple values (Souhila Kaci, Leendert van der Torre), In Int. J. Approx. Reasoning, volume 48, 2008.
Bibtex Entry:
@Article{Kaci2008,
  Title                    = {Preference-based argumentation: Arguments supporting multiple values},
  Author                   = {Souhila Kaci and Leendert van der Torre},
  Journal                  = {Int. J. Approx. Reasoning},
  Year                     = {2008},
  Number                   = {3},
  Pages                    = {730-751},
  Volume                   = {48},

  Abstract                 = {In preference-based argumentation theory, an argument may be preferred to another one when, for example, it is more specific, its beliefs have a higher probability or certainty, or it promotes a higher value. In this paper we generalize Bench-Capon's value-based argumentation theory such that arguments can promote multiple values, and preferences among values or arguments can be specified in various ways. We assume in addition that there is default knowledge about the preferences over the arguments, and we use an algorithm to derive the most likely preference order. In particular, we show how to use non-monotonic preference reasoning to compute preferences among arguments, and subsequently the acceptable arguments, from preferences among values. We show also how the preference ordering can be used to optimize the algorithm to construct the grounded extension by proceeding from most to least preferred arguments. },
  Affiliation              = {icr},
  Bdsk-url-1               = {http://icr.uni.lu/leonvandertorre/papers/ijar07.pdf},
  Bibsource                = {DBLP, http://dblp.uni-trier.de},
  Ee                       = {http://dx.doi.org/10.1016/j.ijar.2007.07.005},
  Timestamp                = {2013.07.26},
  Url                      = {http://icr.uni.lu/leonvandertorre/papers/ijar07.pdf}
}
Powered by bibtexbrowser