16,068 Hits in 2.1 sec

Algorithms for Argumentation Semantics: Labeling Attacks as a Generalization of Labeling Arguments

S. Nofal, K. Atkinson, P. E. Dunne
2014 The Journal of Artificial Intelligence Research  
Specifically, these algorithms are concerned with enumerating all extensions of an AF under a number of argumentation semantics: preferred, stable, complete, semi stable, stage, ideal and grounded.  ...  To demonstrate this impact, we instantiate our algorithms for an example of such models: namely argumentation frameworks with recursive attacks (AFRA), thereby we end up with unified algorithms that enumerate  ...  Acknowledgments We thank the anonymous reviewers for the comments that improved the presentation of this work.  ... 
doi:10.1613/jair.4308 fatcat:wahehpwyufekhio7igm22y5764

On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks

Markus Kröll, Reinhard Pichler, Stefan Woltran
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
for various semantics.  ...  Several computational problems of abstract argumentation frameworks (AFs) such as skeptical and credulous reasoning, existence of a non-empty extension, verification, etc. have been thoroughly analyzed  ...  We thank Wolfgang Dvořák for many fruitful discussions and his help.  ... 
doi:10.24963/ijcai.2017/159 dblp:conf/ijcai/KrollPW17 fatcat:lrmi2hqcsrgf5eze3v3hgyhw3u

Forthcoming Papers

2002 Artificial Intelligence  
Independence-the study of what is relevant to a given problem of reasoning-is an important AI topic.  ...  Toni, On the computational complexity of assumptionbased argumentation for default reasoning Bondarenko et al. have recently proposed an abstract framework for default reasoning.  ...  One important aspect affecting the computational complexity of these problems concerns whether the admissibility of an argument is defined with respect to 'preferred' or 'stable' semantics.  ... 
doi:10.1016/s0004-3702(02)00313-2 fatcat:hemfnxilxrdorbzhnfbf7ary5a

Counting Complexity for Reasoning in Abstract Argumentation [article]

Johannes K. Fichte, Markus Hecher, Arne Meier
2018 arXiv   pre-print
To obtain upper bounds for counting projected extensions, we introduce novel algorithms that exploit small treewidth of the undirected argumentation graph of the input instance by dynamic programming (  ...  In this paper, we consider counting and projected model counting of extensions in abstract argumentation for various semantics.  ...  [32] considered bounded treewidth algorithms and established lower bounds for the runtime of an algorithm that solves credulous or skeptical reasoning in abstract argumentation under the admissible  ... 
arXiv:1811.11501v1 fatcat:jwgkckldh5bnjbmkqh4nmpe65m

Proof Theories and Algorithms for Abstract Argumentation Frameworks [chapter]

Sanjay Modgil, Martin Caminada
2009 Argumentation in Artificial Intelligence  
Acknowledgements The authors would like to thank Gerard Vreeswijk for his contributions to the contents of this chapter. Thanks also to Nir Oren for commenting on a draft of the chapter.  ...  Since A{1} is the only admissible extension known at this stage, it follows that at this stage a is sceptically preferred.  ...  Finally, notice that the algorithm presented here can be made more efficient in a number of ways.  ... 
doi:10.1007/978-0-387-98197-0_6 fatcat:kc5vqztg7badff4nzhvv2xkkwq

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  
In this survey, we give an overview on different methods for solving reasoning problems in abstract argumentation and compare their particular features.  ...  argumentation Algorithms Argumentation systems Within the last decade, abstract argumentation has emerged as a central field in Artificial Intelligence.  ...  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

Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation

Johannes P. Wallner, Andreas Niskanen, Matti Järvisalo
2017 The Journal of Artificial Intelligence Research  
Understanding the dynamics of AFs has been recently recognized as an important topic in the study of argumentation in AI.  ...  Complementing the complexity results, we propose algorithms for NP-hard extension enforcement based on constraint optimization under the maximum satisfiability (MaxSAT) paradigm.  ...  algorithm with access to an NP oracle.  ... 
doi:10.1613/jair.5415 fatcat:dfcx5xtnnvdkpiqwhglf4z64hy

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  ...  After a brief presentation of the competitors, we give an overview of the results.  ...  [21] Andreas Niskanen and Matti Järvisalo. µ-toksia: An efficient abstract argumentation reasoner.  ... 
arXiv:2109.08884v2 fatcat:zu7rhb5hxnflle6ll4ejsspmky

Computing Preferred Labellings by Exploiting SCCs and Most Sceptically Rejected Arguments [chapter]

Beishui Liao, Liyun Lei, Jianhua Dai
2014 Lecture Notes in Computer Science  
However, the efficiency of this approach is highly limited by the maximal SCC of an AF. This paper presents a further solution by exploiting the most sceptically rejected arguments of an AF.  ...  Given an AF, its grounded labelling is first generated. Then, the attacks between the undecided arguments and the rejected arguments are removed.  ...  stage semantics.  ... 
doi:10.1007/978-3-642-54373-9_13 fatcat:kxzz4ocrwbglrevitzjb36ssdm

Identifying Audience Preferences in Legal and Social Domains [chapter]

Paul E. Dunne, Trevor Bench-Capon
2004 Lecture Notes in Computer Science  
While we can establish efficiently the status of an argument for a particular audience, deciding the status of an argument with respect to all potential audiences is known to be intractable.  ...  The main result of this paper is an algorithm which identifies the audiences for which some set of arguments is coherently cotenable.  ...  Ideally we would wish to have an efficient way of determining the status of a particular argument within a VAF: Unfortunately it is shown in [8] that this is unlikely to admit an efficient algorithmic  ... 
doi:10.1007/978-3-540-30075-5_50 fatcat:netnb62smngp3hwpmdum2xw7si

OneArmPhaseTwoStudy: An R Package for Planning, Conducting, and Analysing Single-Arm Phase II Studies

Meinhard Kieser, Marius Wirths, Stefan Englert, Cornelia Ursula Kunz, Geraldine Rauch
2017 Journal of Statistical Software  
The package allows determining an adequate study design for the particular situation at hand as well as monitoring the progress of the study and evaluating the results with valid and efficient analyses  ...  The specification of an adequate study design that guarantees control of the type I and II error rates is a key task in the planning stage of such a trial.  ...  The authors would like to thank Stephanie Kovalchik (Associate Editor) and two anonymous reviewers for their helpful and constructive comments on an earlier version of the manuscript.  ... 
doi:10.18637/jss.v081.i08 fatcat:fiknfdmjfjf3lovttg27dtr4mu

Complexity-sensitive decision procedures for abstract argumentation

Wolfgang Dvořák, Matti Järvisalo, Johannes Peter Wallner, Stefan Woltran
2014 Artificial Intelligence  
Efficient evaluation of AFs has thus been identified as an important research challenge.  ...  argumentation frameworks (AFs) provide the basis for various reasoning problems in the area of Artificial Intelligence.  ...  Finally, deleting the argument g results in an AF that is free of odd-length cycles. For the stage semantics, we can give an even stronger result, namely in terms of acyclic frameworks.  ... 
doi:10.1016/j.artint.2013.10.001 fatcat:jlc67qtkvbaixfihkgryslxt5e

An efficient framework for optimal robust stochastic system design using stochastic simulation

Alexandros A. Taflanidis, James L. Beck
2008 Computer Methods in Applied Mechanics and Engineering  
An efficient framework, consisting of two stages, is presented here for the optimization in such stochastic design problems.  ...  The focus is primarily on the theory and implementation issues for SSO but also on topics related to the combination of the two different stages for overall enhanced efficiency.  ...  The optimization (18) can therefore be efficiently solved if an appropriate algorithm is chosen and, additionally, the admissible subsets are appropriately mathematically described.  ... 
doi:10.1016/j.cma.2008.03.029 fatcat:mxdtezo57zh37ldkhykooqvzki

Page 2813 of Mathematical Reviews Vol. , Issue 2003d [page]

2003 Mathematical Reviews  
Steady state efficiency, the lim- iting efficiency as the number of stages approaches infinity, varies from one distribution to another.  ...  , so that the efficiency of the algorithm cannot be fully evaluated.  ... 

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

Matthias Thimm, Serena Villata
2015 arXiv   pre-print
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  ...  of computational approaches to abstract argumentation problems.  ...  Second, the solver could be made more efficient by replacing Modgil and Caminadas algorithms[7] for computing the labellings of each sub-framework with some more efficient algorithms.  ... 
arXiv:1510.05373v1 fatcat:ll33crzcwfenll4v7yf4xae7ya
« Previous Showing results 1 — 15 out of 16,068 results