Filters








205,210 Hits in 4.7 sec

On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games: 25 years later

Pietro Baroni, Francesca Toni, Bart Verheij
2020 Argument & Computation  
The formal and computational advances inspired by abstract argumentation have been applied in a variety of settings.  ...  Beyond abstract argumentation Abstract argumentation became the basis of extensive research on the formal and computational modeling of argumentation.  ... 
doi:10.3233/aac-200901 fatcat:4nabu4aewnb4rbpseas2yliune

Fuzzy Labeling for Abstract Argumentation: An Empirical Evaluation [chapter]

Célia da Costa Pereira, Mauro Dragoni, Andrea G. B. Tettamanzi, Serena Villata
2016 Lecture Notes in Computer Science  
In a previous approach, we proposed a fuzzy labeling algorithm for computing the (fuzzy) set of acceptable arguments, when the sources of the arguments in the argumentation framework are only partially  ...  Argumentation frameworks have to be evaluated with respect to argumentation semantics to compute the set(s) of accepted arguments.  ...  The set of accepted arguments, called extensions, represent consistent set(s) of arguments that can be accepted together.  ... 
doi:10.1007/978-3-319-45856-4_9 fatcat:alha54zg3necla6lsexv5mzpwe

System Descriptions of the First International Competition on Computational Models of Argumentation (ICCMA'15) [article]

Matthias Thimm, Serena Villata
2015 arXiv   pre-print
of computational approaches to abstract argumentation problems.  ...  This volume contains the system description of the 18 solvers submitted to the First International Competition on Computational Models of Argumentation (ICCMA'15) and therefore gives an overview on state-of-the-art  ...  framework, calculates the set of arguments acceptable w.r.t. a given set of arguments.  ... 
arXiv:1510.05373v1 fatcat:ll33crzcwfenll4v7yf4xae7ya

Efficiently Estimating the Probability of Extensions in Abstract Argumentation [chapter]

Bettina Fazzinga, Sergio Flesca, Francesco Parisi
2013 Lecture Notes in Computer Science  
2) Abstract Argumentation Framework (AAF) [Dung 1995]: arguments are abstract entities (no attention is paid to their internal structure) that may attack and/or be attacked by other arguments Example  ...  ) a = Our friends will have great fun at our party on Saturday b = Saturday will rain (according to the weather forecasting service 1) c = Saturday will be sunny (according to the weather forecasting service  ...  proposed to identify "reasonable" sets of arguments Complexity of Probabilistic Abstract Argumentation PROB sem (S) is the problem of computing the probability Pr sem (S) that a set S of arguments is reasonable  ... 
doi:10.1007/978-3-642-40381-1_9 fatcat:zyodjjwrcbbzjejk6q4ndlqk3e

From Structured to Abstract Argumentation: Assumption-Based Acceptance via AF Reasoning [chapter]

Tuomo Lehtonen, Johannes P. Wallner, Matti Järvisalo
2017 Lecture Notes in Computer Science  
We study the applicability of abstract argumentation (AF) reasoners in efficiently answering acceptability queries over assumption-based argumentation (ABA) frameworks, one of the prevalent forms of structured  ...  We empirically show that the approach is complementary with a state-of-the-art ABA reasoning system.  ...  Secondly, we might compute arguments with assumption sets not in minsupp(D).  ... 
doi:10.1007/978-3-319-61581-3_6 fatcat:i34d3m4jfjdefe6phxspbw5bse

Propagating degrees of truth on an argumentation framework

Pierpaolo Dondio
2017 Proceedings of the Symposium on Applied Computing - SAC '17  
We propose a truth-compositional recursive computation based on the notion of irrelevant arguments, and we discuss examples using the major multi-valued logics: Godel's, Zadeh's and Łukasiewicz's logic  ...  Abstract grounded semantics is used to identify the conditions under which a conclusion can be accepted, while multi-valued logic operators are used to quantify the degree of truth of such conditions.  ...  acceptable, non-acceptable or undecided (i.e. no decision can be taken on argument acceptability).  ... 
doi:10.1145/3019612.3019717 dblp:conf/sac/Dondio17 fatcat:gve3pvsn2bdidkfk6dgs6kpcty

Credulous and skeptical acceptability in probabilistic abstract argumentation: complexity results

Bettina Fazzinga, Sergio Flesca, Filippo Furfaro, Stefano Bistarelli, Massimiliano Giacomin, Andrea Pazienza
2019 Intelligenza Artificiale  
In this setting, we address the fundamental problem of computing the probability that an argument is (credulously) acceptable according to a given semantics.  ...  Specifically, we focus on the most popular semantics (i.e., admissible, stable, semi-stable, complete, grounded, preferred, ideal, ideal-set), and show that computing the probability that an argument is  ...  [8] addresses the problem of computing all the subgraphs of an AAF in which an argument a belongs to the grounded extension, and [9] extends it by focusing on computing the probability that an argument  ... 
doi:10.3233/ia-180041 fatcat:gqkte6g4lrcenfxfnfqcwm3jum

A natural language bipolar argumentation approach to support users in online debate interactions†

Elena Cabrio, Serena Villata
2013 Argument & Computation  
Argumentation theory proposes algorithms and semantics to evaluate the set of accepted arguments, given the conflicts among them.  ...  In order to cut in on a debate, the participants need first to evaluate the opinions in favour or against the debated issue.  ...  Second, we adopt abstract Dung-like argumentation theory [10] to reason over the set of generated arguments with the aim of deciding which are the accepted ones.  ... 
doi:10.1080/19462166.2013.862303 fatcat:5abbrmzbxnb3bawjsekucthoba

Smallest Explanations and Diagnoses of Rejection in Abstract Argumentation

Andreas Niskanen, Matti Järvisalo
2020 Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning  
Deciding acceptance of arguments is a central problem in the realm of abstract argumentation.  ...  Beyond mere acceptance status, when an argument is rejected it would be informative to analyze reasons for the rejection.  ...  The authors thank Alexey Ignatiev for advice on Forqes and Johannes P. Wallner for assistance on computing explanations with the ASP approach.  ... 
doi:10.24963/kr.2020/67 dblp:conf/kr/NiskanenJ20 fatcat:gtdeh6r2fzetleu3dhybziwyni

Corrupt Strategic Argumentation: The Ideal and the Naive [chapter]

Michael J. Maher
2016 Lecture Notes in Computer Science  
We show that the naive semantics does not support strategic argumentation, in the sense that the outcome of the game is determined by the initial state, if the players are not corrupt.  ...  Such a result provides a (limited) basis on which to trust agents acting on our behalf. That work addressed several argumentation semantics, all built on the notion of admissibility.  ...  Background Abstract Argumentation This work is based on abstract argumentation in the sense of [6] , which addresses the evaluation of a static set of arguments.  ... 
doi:10.1007/978-3-319-50127-7_2 fatcat:kaitd6la6fh45cstj6wicf5u7e

Transferring Knowledge from Discourse to Arguments: A Case Study with Scientific Abstracts

Pablo Accuosto, Horacio Saggion
2019 Proceedings of the 6th Workshop on Argument Mining  
As a pilot application, we explore the feasibility of using automatically identified argumentative components and relations to predict the acceptance of papers in computer science venues.  ...  In this work we propose to leverage resources available with discourse-level annotations to facilitate the identification of argumentative components and relations in scientific texts, which has been recognized  ...  Acknowledgments This work is (partly) supported by the Spanish Government under the María de Maeztu Units of Excellence Programme (MDM-2015-0502).  ... 
doi:10.18653/v1/w19-4505 dblp:conf/argmining/AccuostoS19 fatcat:bta5xiznsrbtnntoarbodzelky

Abstractly Interpreting Argumentation Frameworks for Sharpening Extensions [article]

Ryuta Arisaka, Jeremie Dauphin
2018 arXiv   pre-print
not just on an argument graph but also on the semantic relation among the arguments in the graph.  ...  While a few methods were proposed for treating them, to - in particular - enable selection of acceptable arguments in an odd-length cycle when Dung semantics could select none, so far the issues have been  ...  Acknowledgement We thank Leon van der Torre and Ken Satoh for discussion on related topics which greatly influeced this work of ours.  ... 
arXiv:1802.01526v1 fatcat:7ct7yq6p3bdrnowq3xsezqew3y

dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation [chapter]

Wolfgang Dvořák, Michael Morak, Clemens Nopp, Stefan Woltran
2013 Lecture Notes in Computer Science  
The aim of this paper is to announce the release of a novel system for abstract argumentation which is based on decomposition and dynamic programming.  ...  We provide first experimental evaluations to show the feasibility of this approach.  ...  For instance to compute the admissible sets of our running example one can use the following command: > .  ... 
doi:10.1007/978-3-642-41524-1_14 fatcat:gdzqqsak55ejxfnedanprk3hki

What Can Argumentation Do for Inconsistent Ontology Query Answering? [chapter]

Madalina Croitoru, Srdjan Vesic
2013 Lecture Notes in Computer Science  
Given a set of arguments and attacks between them, one applies a particular semantics (e.g. stable, preferred, grounded) to calculate the sets of accepted arguments and conclusions.  ...  To deal with such a situation, different semantics have been defined in the literature (e.g. AR, IAR, ICR). Argumentation theory can also be used to draw conclusions under inconsistency.  ...  Maximal consistent subsets of the KB, called repairs, are then considered and different semantics (based on classical entailment on repairs) are proposed in order to compute the set of accepted formulae  ... 
doi:10.1007/978-3-642-40381-1_2 fatcat:andrngwqibd67kttoghv73xr54

Abstract Argumentation via Monadic Second Order Logic [chapter]

Wolfgang Dvořák, Stefan Szeider, Stefan Woltran
2012 Lecture Notes in Computer Science  
We propose the formalism of Monadic Second Order Logic (MSO) as a unifying framework for representing and reasoning with various semantics of abstract argumentation.  ...  In particular, we obtain that for argumentation frameworks with certain structural properties the main computational problems with respect to MSO-expressible semantics can all be solved in linear time.  ...  understood and different semantics (i.e., the selection of sets of arguments which are jointly acceptable) have been proposed.  ... 
doi:10.1007/978-3-642-33362-0_7 fatcat:i3rwaxqnqbdhnjagsfrmljljhi
« Previous Showing results 1 — 15 out of 205,210 results