A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
dialectical frameworks (ADFs) are a knowledge representation formalism introduced as a generalisation of Dung's abstract argumentation frameworks (AFs) by Gerhard Brewka and coauthors. We look at a judgment aggregation problem in ADFs, namely the problem of aggregating a profile of complete interpretations. We generalise the family of interval aggregation methods, studied in the AF case in our previous work, to the ADF case. Along the way we define the notions of down-admissible and up-completedoi:10.1007/978-3-319-14726-0_20 fatcat:4l4lklkzsbgchlo42k4cxecgxa