750 research outputs found
Online Handbook of Argumentation for AI: Volume 1
This volume contains revised versions of the papers selected for the first
volume of the Online Handbook of Argumentation for AI (OHAAI). Previously,
formal theories of argument and argument interaction have been proposed and
studied, and this has led to the more recent study of computational models of
argument. Argumentation, as a field within artificial intelligence (AI), is
highly relevant for researchers interested in symbolic representations of
knowledge and defeasible reasoning. The purpose of this handbook is to provide
an open access and curated anthology for the argumentation research community.
OHAAI is designed to serve as a research hub to keep track of the latest and
upcoming PhD-driven research on the theory and application of argumentation in
all areas related to AI.Comment: editor: Federico Castagna and Francesca Mosca and Jack Mumford and
Stefan Sarkadi and Andreas Xydi
A Discussion Game for the Credulous Decision Problem of Abstract Dialectical Frameworks under Preferred Semantics
Abstract dialectical frameworks (ADFs) have been introduced as a general formalism for modeling and evaluating argumentation. However, the role of discussion in reasoning in ADFs has not been clarified well so far. The current work presents a discussion game, as a proof method, to answer credulous decision problems of ADFs under preferred semantics. The game can be the basis for an algorithm that can be used not only for answering the decision problem but also for human-machine interaction
Recommended from our members
Computational Argumentation-based Chatbots: a Survey
The article archived on this institutional repository is a preprint. It has not been certified by peer review.Chatbots are conversational software applications designed to interact dialectically with users for a plethora of different purposes. Surprisingly, these colloquial agents have only recently been coupled with computational models of arguments (i.e. computational argumentation), whose aim is to formalise, in a machine-readable format, the ordinary exchange of information that characterises human communications. Chatbots may employ argumentation with different degrees and in a variety of manners. The present survey sifts through the literature to review papers concerning this kind of argumentation-based bot, drawing conclusions about the benefits and drawbacks that this approach entails in comparison with standard chatbots, while also envisaging possible future development and integration with the Transformer-based architecture and state-of-the-art Large Language models
Debating Technology for Dialogical Argument:Sensemaking, Engagement and Analytics
Debating technologies, a newly emerging strand of research into computational technologies to support human debating, offer a powerful way of providing naturalistic, dialogue-based interaction with complex information spaces. The full potential of debating technologies for dialogical argument can, however, only be realized once key technical and engineering challenges are overcome, namely data structure, data availability, and interoperability between components. Our aim in this article is to show that the Argument Web, a vision for integrated, reusable, semantically rich resources connecting views, opinions, arguments, and debates online, offers a solution to these challenges. Through the use of a running example taken from the domain of citizen dialogue, we demonstrate for the first time that different Argument Web components focusing on sensemaking, engagement, and analytics can work in concert as a suite of debating technologies for rich, complex, dialogical argument
On the interplay between games, argumentation and dialogues
Game theory, argumentation and dialogues all address problems concerning inter-agent interaction, but from different perspectives. In this paper, we contribute to the study of the interplay between these fields. In particular, we show that by mapping games in normal form into structured argumentation, computing dominant solutions and Nash equilibria is equivalent to computing admissible sets of arguments. Moreover, when agents lack complete information, computing dominant solutions/Nash equilibria is equivalent to constructing successful (argumentation-based) dialogues. Finally, we study agents’ behaviour in these dialogues in reverse game-theoretic terms and show that, using specific notions of utility, agents engaged in (argumentation-based) dialogues are guaranteed to be truthful and disclose relevant information, and thus can converge to dominant solutions/Nash equilibria of the original games even under incomplete information
- …