Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems

摘要: Dung’s famous abstract argumentation frameworks represent the core formalism for many problems and applications in field of which significantly evolved within last decade. Recent work has thus focused on implementations these frameworks, whereby one main approaches is to use Answer-Set Programming (ASP). While some semantics can be nicely expressed ASP language, others required rather cumbersome encoding techniques. advances systems, particular, metasp optimization front-end ASP-package gringo/claspD provide direct commands filter answer sets satisfying certain subset-minimality (or -maximality) constraints. This allows much simpler encodings compared ones standard language. In this paper, we experimentally compare original (for based preferred, semi-stable, respectively, stage extensions) with new encodings. Moreover, novel recently introduced resolution-based grounded semantics. Our experimental results indicate that approach works well those cases where complexity encoded problem adequately mirrored approach.