Filters








4,734 Hits in 2.3 sec

Skeptical Reasoning with Preferred Semantics in Abstract Argumentation without Computing Preferred Extensions

Matthias Thimm, Federico Cerutti, Mauro Vallati
2021 Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence   unpublished
We address the problem of deciding skeptical acceptance wrt. preferred semantics of an argument in abstract argumentation frameworks, i.e., the problem of deciding whether an argument is contained in all  ...  We provide a new characterisation of skeptical acceptance wrt. preferred semantics that does not involve the notion of a preferred extension.  ...  The interesting aspect of the above theorem is that it characterises skeptical acceptance wrt. preferred semantics without the notion of a preferred extension.  ... 
doi:10.24963/ijcai.2021/285 fatcat:h4ptowxzjfcinmk4bxjvbgxjai

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.  ...  Skeptical Reasoning: To decide skeptical acceptance, dynPARTIX uses proof procedures for preferred extensions which usually results in higher computational costs (but is unavoidable due to complexity results  ...  /dynpartix -f inputAF -s preferred -- Benchmark Tests In this section we compare dynPARTIX with ASPARTIX [7] , one of the most efficient reasoning tools for abstract argumentation (for an overview of  ... 
doi:10.1007/978-3-642-41524-1_14 fatcat:gdzqqsak55ejxfnedanprk3hki

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  ...  LabSAT is a solver for computing several reasoning tasks in abstract argumentation frameworks. It enumerates extensions of the complete, preferred, stable and grounded semantics.  ... 
arXiv:1510.05373v1 fatcat:ll33crzcwfenll4v7yf4xae7ya

Methods for solving reasoning problems in abstract argumentation – A survey

Günther Charwat, Wolfgang Dvořák, Sarah A. Gaggl, Johannes P. Wallner, Stefan Woltran
2015 Artificial Intelligence  
Although the idea of abstract argumentation is appealingly simple, several reasoning problems in this formalism exhibit high computational complexity.  ...  In this survey, we give an overview on different methods for solving reasoning problems in abstract argumentation and compare their particular features.  ...  The authors are grateful to the anonymous reviewers for their detailed reviews and helpful comments as well as to all colleagues who discussed their works and systems with the authors.  ... 
doi:10.1016/j.artint.2014.11.008 pmid:25737590 pmcid:PMC4318991 fatcat:qrw6bic4vjc5zdqkvi5tlhcs7m

Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension [chapter]

Guido Boella, Souhila Kaci, Leendert van der Torre
2009 Lecture Notes in Computer Science  
In this paper we consider the dynamics of abstract argumentation in Baroni and Giacomin's framework for the evaluation of extension based argumentation semantics.  ...  In particular, we define abstraction principles for the attack relation, and for the arguments in the framework. We illustrate the principles on the grounded extension.  ...  Thus, in the skeptical preferred semantics there is an undecided argument that attacks an accepted argument, whereas in the grounded semantics, there is no such argument.  ... 
doi:10.1007/978-3-642-02906-6_11 fatcat:g3ur4eax55bcpbwfex5mqok3nm

Comparing Argumentation Semantics with Respect to Skepticism [chapter]

Pietro Baroni, Massimiliano Giacomin
2007 Lecture Notes in Computer Science  
The issue of formalizing skepticism relations between argumentation semantics has been considered only recently in the literature.  ...  In this paper, we contribute to this kind of analysis by providing a systematic comparison of a significant set of literature semantics (namely grounded, complete, preferred, stable, semi-stable, ideal  ...  Having completed the analysis concerning argumentation semantics able to prescribe extensions in any case, in Figure 8 we provide (without comments and proofs due to space limitation) the Hasse diagrams  ... 
doi:10.1007/978-3-540-75256-1_21 fatcat:pxzxn4vibncx5i5safk7gcsc7y

An experimental analysis on the similarity of argumentation semantics

Federico Cerutti, Matthias Thimm, Mauro Vallati
2020 Argument & Computation  
While it is clear from theoretical results that reasoning with grounded semantics is different from, for example, skeptical reasoning with preferred semantics, we investigate how significant this difference  ...  In this paper we ask whether approximation for abstract argumentation is useful in practice, and in particular whether reasoning with grounded semantics – which has polynomial runtime – is already an approximation  ...  Introduction Dung's theory of abstract argumentation [17] unifies a large variety of formalisms in nonmonotonic reasoning, logic programming and computational argumentation.  ... 
doi:10.3233/aac-200907 fatcat:zdcicncxsnggxgnrehqi6kdmyy

Complexity-sensitive decision procedures for abstract argumentation

Wolfgang Dvořák, Matti Järvisalo, Johannes Peter Wallner, Stefan Woltran
2014 Artificial Intelligence  
abstract argumentation, providing further understanding on the sources of intractability of AF reasoning problems.  ...  argumentation frameworks (AFs) provide the basis for various reasoning problems in the area of Artificial Intelligence.  ...  In particular, many important reasoning problems for AFs are located on the second level of the polynomial hierarchy, including skeptical reasoning in the preferred semantics [2] , and both skeptical  ... 
doi:10.1016/j.artint.2013.10.001 fatcat:jlc67qtkvbaixfihkgryslxt5e

Abstract solvers for Dung's argumentation frameworks

Remi Brochenin, Thomas Linsbichler, Marco Maratea, Johannes P. Wallner, Stefan Woltran
2018 Argument & Computation  
We provide descriptions of several advanced algorithms for the preferred semantics in terms of abstract solvers and, moreover, show how slight adaptions thereof directly lead to new algorithms.  ...  In this paper, we apply this machinery for the first time to a dedicated AI formalism, namely Dung's abstract argumentation frameworks.  ...  On the other hand, argument a is skeptically accepted under preferred semantics in F as it belongs to all preferred extensions enumerated in {{a, d}, {a, c}}.  ... 
doi:10.3233/aac-170031 fatcat:lpy7qwj4xfbxnnsy2p2jnlfeby

An Efficient Java-Based Solver for Abstract Argumentation Frameworks: jArgSemSAT

Federico Cerutti, Mauro Vallati, Massimiliano Giacomin
2017 International journal on artificial intelligence tools  
complexity-Stable and Preferred-in the last competition on computational models of argumentation.  ...  ArgSemSAT represents the best single solver for argumentation semantics with the highest level of computational complexity.  ...  Matthias Thimm-Universität Koblenz-Landau-for his support in integrating jArgSemSAT with Tweety, and Dr. Alice Toniolo-University of Aberdeenfor integrating jArgSemSAT within CISpaces.  ... 
doi:10.1142/s0218213017500026 fatcat:3xs5vl5jgjgqtc362wswl7wvau

Argumentation Context Systems: A Framework for Abstract Group Argumentation [chapter]

Gerhard Brewka, Thomas Eiter
2009 Lecture Notes in Computer Science  
We introduce a modular framework for distributed abstract argumentation where the argumentation context, that is information about preferences among arguments, values, validity, reasoning mode (skeptical  ...  in [21] . 8 For simplicity, names of abstract arguments in M2 reflect their intended meaning.  ...  On the other hand, skeptical inference from all preferred extensions is Π p 2 -complete [12] , which in combination with the module framework generates the Σ p 3 -hardness.  ... 
doi:10.1007/978-3-642-04238-6_7 fatcat:hg5avvasynhi7jvvmvhluxnyey

Design and Results of ICCMA 2021 [article]

Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly, Julien Rossit
2021 arXiv   pre-print
Since 2015, the International Competition on Computational Models of Argumentation (ICCMA) provides a systematic comparison of the different algorithms for solving some classical reasoning problems in  ...  the domain of abstract argumentation.  ...  Harper++: Using grounded semantics for approximate reasoning in abstract argumentation. http://www.mthimm.de/pub/2021/Thimm_2021.pdf, 2021.  ... 
arXiv:2109.08884v2 fatcat:zu7rhb5hxnflle6ll4ejsspmky

Abstract Solvers for Dung's Argumentation Frameworks [chapter]

Remi Brochenin, Thomas Linsbichler, Marco Maratea, Johannes Peter Wallner, Stefan Woltran
2015 Lecture Notes in Computer Science  
We provide descriptions of several advanced algorithms for the preferred semantics in terms of abstract solvers and, moreover, show how slight adaptions thereof directly lead to new algorithms.  ...  In this paper, we apply this machinery for the first time to a dedicated AI formalism, namely Dung's abstract argumentation frameworks.  ...  On the other hand, argument a is skeptically accepted under preferred semantics in F as it belongs to all preferred extensions enumerated in {{a, d}, {a, c}}.  ... 
doi:10.1007/978-3-319-28460-6_3 fatcat:4isf2w7zwrcsznizfjxlqwomt4

Argumentation and graph properties

Mamadou Bilo Doumbouya, Bernard Kamsu-Foguem, Hugues Kenfack
2016 Information Processing & Management  
The determination of accepted arguments under a given semantics (admissible, preferred, stable, etc.) can be a time-consuming and tedious (in number of steps) process.  ...  In this argumentation framework, the semantics of acceptance plays a fundamental role in the argument evaluation process.  ...  semantics, for computing preferred labellings, etc.).  ... 
doi:10.1016/j.ipm.2015.08.003 fatcat:27r4sriko5arpoq2ggdg223bgq

Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation [article]

Tuomo Lehtonen, Johannes P. Wallner, Matti Järvisalo
2021 arXiv   pre-print
level of the polynomial hierarchy, including skeptical reasoning under preferred semantics as well as preferential reasoning.  ...  Assumption-based argumentation (ABA) is a central structured argumentation formalism.  ...  Skeptical Acceptance under Preferred Semantics We begin with skeptical reasoning under preferred semantics in ABA, which is a Π P 2 -complete problem.  ... 
arXiv:2108.04192v1 fatcat:hlp6weg6cbc27p7vk5xxnzkxxe
« Previous Showing results 1 — 15 out of 4,734 results