Srdjan Vesić
YOU?
Author Swipe
View article: Can LLMs Judge Debates? Evaluating Non-Linear Reasoning via Argumentation Theory Semantics
Can LLMs Judge Debates? Evaluating Non-Linear Reasoning via Argumentation Theory Semantics Open
Large Language Models (LLMs) excel at linear reasoning tasks but remain underexplored on non-linear structures such as those found in natural debates, which are best expressed as argument graphs. We evaluate whether LLMs can approximate st…
View article: Can LLMs Judge Debates? Evaluating Non-Linear Reasoning via Argumentation Theory Semantics
Can LLMs Judge Debates? Evaluating Non-Linear Reasoning via Argumentation Theory Semantics Open
International audience
View article: Collective Satisfaction Semantics for Opinion Based Argumentation
Collective Satisfaction Semantics for Opinion Based Argumentation Open
Voting on arguments in a debate is a natural approach for reaching a consensual decision. Despite this, there are few formal methods of abstract argumentation dealing with the use of votes in the process of selecting accepted arguments. We…
View article: Reassessing the Impact of Reading Behaviour in Online Debates Under the Lens of Gradual Semantics
Reassessing the Impact of Reading Behaviour in Online Debates Under the Lens of Gradual Semantics Open
International audience
View article: Human Compliance with Normative Principles in Argumentation: Effects of Naturalness Bias and Graphical Representation
Human Compliance with Normative Principles in Argumentation: Effects of Naturalness Bias and Graphical Representation Open
International audience
View article: Impact Measures for Gradual Argumentation Semantics
Impact Measures for Gradual Argumentation Semantics Open
Argumentation is a formalism allowing to reason with contradictory information by modeling arguments and their interactions. There are now an increasing number of gradual semantics and impact measures that have emerged to facilitate the in…
View article: On Learning Bipolar Gradual Argumentation Semantics with Neural Networks
On Learning Bipolar Gradual Argumentation Semantics with Neural Networks Open
International audience
View article: Parametrized Gradual Semantics Dealing with Varied Degrees of Compensation
Parametrized Gradual Semantics Dealing with Varied Degrees of Compensation Open
Compensation is a strategy that a semantics may follow when it faces dilemmas between quality and quantity of attackers. It allows several weak attacks to compensate one strong attack. It is based on compensation degree, which is a tuple t…
View article: A Principle-based Account of Self-attacking Arguments in Gradual Semantics
A Principle-based Account of Self-attacking Arguments in Gradual Semantics Open
The issue of how a semantics should deal with self-attacking arguments was always a subject of debate among argumentation scholars. A consensus exists for extension-based semantics because those arguments are always rejected (as soon as th…
View article: Inverse Problems for Gradual Semantics
Inverse Problems for Gradual Semantics Open
Gradual semantics with abstract argumentation provide each argument with a score reflecting its acceptability. Many different gradual semantics have been proposed in the literature, each following different principles and producing differe…
View article: The Inverse Problem for Argumentation Gradual Semantics
The Inverse Problem for Argumentation Gradual Semantics Open
Gradual semantics with abstract argumentation provide each argument with a score reflecting its acceptability, i.e. how "much" it is attacked by other arguments. Many different gradual semantics have been proposed in the literature, each f…
View article: Evaluation of argument strength in attack graphs: Foundations and semantics
Evaluation of argument strength in attack graphs: Foundations and semantics Open
An argumentation framework is a pair made of a graph and a semantics. The nodes and the edges of the graph represent respectively arguments and relations (e.g., attacks, supports) between arguments while the semantics evaluates the strengt…
View article: Representing pure Nash equilibria in argumentation
Representing pure Nash equilibria in argumentation Open
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. Our approach builds on Modgil’s Extended Argumentation Frameworks…
View article: Preface for the special issue on argument strength
Preface for the special issue on argument strength Open
Arguments may vary in strength.The strength of an argument is influenced by different factors like the plausibility of its premises or the nature of the link between its premises and conclusion.The first Argument Strength workshop was orga…
View article: Dung's semantics satisfy attack removal monotonicity
Dung's semantics satisfy attack removal monotonicity Open
We show that preferred, stable, complete, and grounded semantics satisfy attack removal monotonicity. This means that if an attack from b to a is removed, the status of a cannot worsen, e.g. if a was skeptically accepted, it cannot become …
View article: Dung's semantics satisfy attack removal monotonicity
Dung's semantics satisfy attack removal monotonicity Open
We show that preferred, stable, complete, and grounded semantics satisfy attack removal monotonicity. This means that if an attack from b to a is removed, the status of a cannot worsen, e.g. if a was skeptically accepted, it cannot become …
View article: Ranking Semantics for Argumentation Systems With Necessities
Ranking Semantics for Argumentation Systems With Necessities Open
Bipolar argumentation studies argumentation graphs where attacks are combined with another relation between arguments. Many kind of relations (e.g. deductive support, evidential support, necessities etc.) have been defined and investigated…
View article: Representing Pure Nash Equilibria in Argumentation
Representing Pure Nash Equilibria in Argumentation Open
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. Our approach builds on Modgil's Extended Argumentation Frameworks…
View article: Ranking-Based Semantics for Sets of Attacking Arguments
Ranking-Based Semantics for Sets of Attacking Arguments Open
Argumentation is a process of evaluating and comparing sets of arguments. Ranking-based semantics received a lot of attention recently. All of the semantics introduced so far are applicable to binary attack relations. In this paper, we stu…
View article: Sets of Attacking Arguments for Inconsistent Datalog Knowledge Bases
Sets of Attacking Arguments for Inconsistent Datalog Knowledge Bases Open
International audience