Search Results for author:
Found 7 papers, 0 papers with code
The Inverse Problem for Argumentation Gradual Semantics
A sub-class of such semantics, the so-called weighted semantics, takes, in addition to the graph structure, an initial set of weights over the arguments as input, with these weights affecting the resultant argument ranking.
Dung's semantics satisfy attack removal monotonicity
We show that preferred, stable, complete, and grounded semantics satisfy attack removal monotonicity.
Representing Pure Nash Equilibria in Argumentation
In this paper we describe an argumentation-based representation of normal form games, and demonstrate how argumentation can be used to compute pure strategy Nash equilibria.
A note on the uniqueness of models in social abstract argumentation
Social abstract argumentation is a principled way to assign values to conflicting (weighted) arguments.
Agenda Separability in Judgment Aggregation
One of the better studied properties for operators in judgment aggregation is independence, which essentially dictates that the collective judgment on one issue should not depend on the individual judgments given on some other issue(s) in the same agenda.
A partial taxonomy of judgment aggregation rules, and their properties
The literature on judgment aggregation is moving from studying impossibility results regarding aggregation rules towards studying specific judgment aggregation rules.
Identifying the Class of Maxi-Consistent Operators in Argumentation
An important question is then: what is the class of logics that can be subsumed as instantiations of this theory?
