1,720,983 research outputs found
Power index-based semantics for ranking arguments in abstract argumentation frameworks: An overview
No full textRanking-based semantics for Abstract Argumentation Frameworks represent a well-established concept used for sorting arguments from the most to the least acceptable. This paper presents an overview of our ranking-based semantics that makes use of power indexes such as Shapley Value and Banzhaf Index. Such power index-based semantics is parametric to a chosen Dung semantics and inherits their properties
A concurrent language for negotiation and debate with argumentation
No full textThis paper summarises the main results obtained within my Ph.D. thesis where I studied argumentation from the point of view of dynamics, focusing, in particular, in the ability to manage the evolution of information. I considered different aspects of argumentation and devised theoretical and practical tools useful for developing argumentation-based applications in the context of multi-agent systems, where complex interactions between agents need to be modelled and handled
A study of robustness in abstract argumentation frameworks
No full textIn this paper we describe a work-in-progress on the study of robustness (intended as how many changes can an Argumentation Framework sustain before its semantics turns into another): in particular we present a tool able to visualize Argumentation Frameworks as nodes in a graph and highlight those with certain properties, like a specific semantics or attacks' type. This tool will be used to find relations between an Argumentation Framework and the sets of extensions accepted by each semantics and eventually, to extract new theorems in order to cope with some of the open problem related to abstract argumentation
A Unifying Four-State Labelling Semantics for Bridging Abstract Argumentation Frameworks and Belief Revision
No full textIn many formalisms extending Dung's Abstract Argumentation Frameworks (AFs), arguments are not always "present". In timed AFs, for instance, arguments are only available in precise intervals of time, as they can appear and disappear in an intermittent manner; in incomplete AFs, both attacks and arguments can be absent; in constellation probabilistic AFs (attacks and) arguments have a probability to be present or not, and possible worlds are generated for the computation of the semantics. We review current approaches and propose a four-state labelling semantics to take in account such absent/unknown state of an argument. The four labels we use can be traced to the states a belief can assume, allowing us to also define operations related to belief manipulation, like expansion contraction and revision. We also discuss how labels/states of arguments in an AFs can be modified by using belief revision operations
A concurrent language for argumentation
No full textWhile agent-based modelling languages naturally implement concurrency, the currently available languages for argumentation do not allow to explicitly model this type of interaction. In this paper we introduce a concurrent language for handling process arguing and communicating using a shared argumentation framework (reminding shared constraint store as in concurrent constraint). We introduce also basic expansions, contraction and revision procedures as main bricks for enforcement, debate, negotiation and persuasion
Power index-based semantics for ranking arguments in abstract argumentation frameworks
No full textRanking-based semantics for Abstract Argumentation Frameworks represent a well-established concept used for sorting a group of arguments from the most to the least acceptable. This paper describes a ranking-based semantics that makes use of power indexes such as the Shapley Value and the Banzhaf Power Index. This power index-based semantics is parametric to a chosen Dung semantics and inherits the properties of the index that is used for evaluating the arguments. We highlight the characteristics of the rankings obtained through different evaluation functions and we verify which of the properties from the literature are satisfied. Finally, we study the relation between the (skeptical/credulous) acceptability of an argument and its position in the ranking, thus designing new properties
Introducing a Tool for Concurrent Argumentation
No full textAgent-based modelling languages naturally implement concurrency for handling complex interactions between communicating agents. On the other hand, the field of Argumentation Theory lacks of instruments to explicitly model concurrent behaviours. In this paper we introduce a tool for dealing with concurrent argumentation processes and that can be used, for instance, to model agents debating, negotiating and persuading. The tool implements operations as expansion, contraction and revision. We also provide a web interface exposing the functionalities of the tool and allowing for a more careful study of concurrent processes
A Labelling Semantics and Strong Admissibility for Weighted Argumentation Frameworks
No full textArgumentation Theory provides tools for both modelling and reasoning with controversial information and is a methodology that is often used as a way to give explanations to results provided using machine learning techniques. In this context, labelling-based semantics for Abstract Argumentation Frameworks (AFs) allow for establishing the acceptability of sets of arguments, dividing them into three partitions: in, out and undecidable (instead of classical Dung acceptable and not acceptable sets). This kind of semantics have been studied only for classical AFs, while the more powerful weighted and preference-based frameworks have not been studied yet. In this paper, we define a novel labelling semantics for Weighted Argumentation Frameworks (WAFs), extending and generalizing the crisp one, and we provide some insights towards a definition of strong admissibility for WAFs
A concurrent language for argumentation: Preliminary notes
No full textWhile agent-based modelling languages naturally implement concurrency, the currently available languages for argumentation do not allow to explicitly model this type of interaction. In this paper we introduce a concurrent language for handling process arguing and communicating using a shared argumentation framework (reminding shared constraint store as in concurrent constraint). We introduce also basic expansions, contraction and revision procedures as main bricks for enforcement, debate, negotiation and persuasion
Towards an Implementation of a Concurrent Language for Argumentation
No full textWhile agent-based modelling languages naturally implement concurrency, the currently available languages for argumentation do not allow to explicitly model this type of interaction. In this paper we introduce a concurrent language for handling process arguing and communicating using a shared argumentation framework (reminding shared constraint store as in concurrent constraint). We introduce also basic expansions, contraction and revision procedures as main bricks for enforcement, debate, negotiation and persuasion
- …
