84,814 Hits in 4.4 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.  ...  We thus investigate the enumeration complexity of AFs for a large collection of semantics and, in addition, consider the most common structural restrictions on AFs.  ...  We thank Wolfgang Dvořák for many fruitful discussions and his help.  ... 
doi:10.24963/ijcai.2017/159 dblp:conf/ijcai/KrollPW17 fatcat:lrmi2hqcsrgf5eze3v3hgyhw3u

Counting Complexity for Reasoning in Abstract Argumentation [article]

Johannes K. Fichte, Markus Hecher, Arne Meier
2018 arXiv   pre-print
Finally, we take the exponential time hypothesis (ETH) into account and establish lower bounds of bounded treewidth algorithms for counting extensions and projected extension.  ...  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 (  ...  For semi-stable statements the reductions by Dvořák and Woltran [18] can be applied, since preferred and semi-stable extensions of the constructed argumentation framework coincide.  ... 
arXiv:1811.11501v1 fatcat:jwgkckldh5bnjbmkqh4nmpe65m

On the Computation of Paracoherent Answer Sets [article]

Giovanni Amendola, Carmine Dodaro, Wolfgang Faber, Nicola Leone, Francesco Ricca
2017 arXiv   pre-print
In this paper, this lack is addressed, and several different algorithms to compute semi-stable and semi-equilibrium models are proposed and implemented into an answer set solving framework.  ...  However, paracoherent semantics have essentially been inapplicable in practice, due to the lack of efficient algorithms and implementations.  ...  Like semi-stable models, semi-equilibrium models may be computed as maximal canonical answer sets, of an extension of the epistemic κ-transformation.  ... 
arXiv:1707.06813v1 fatcat:2jtg3wvlpjedbodtkmmegbh3du

Page 476 of Mathematical Reviews Vol. , Issue 98A [page]

1998 Mathematical Reviews  
Summary: “This paper gives an efficient semi-naive algorithm for Datalog programs which is a modification of the usual semi- naive algorithm.  ...  (H-EOTVO-GC; Budapest); Manh Thanh Le (H-EOTVO-GC; Budapest) An efficient semi-naive algorithm for Datalog. (English summary) Ann. Univ. Sci. Budapest. Sect. Comput. 15 (1995), 125-141.  ... 

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.  ...  However, every semi-stable extension is a preferred extension, which suggests that we can adapt Section 5.1's algorithm for preferred labellings in order to compute semi-stable labellings.  ...  (R1 ) Since every semi-stable extension is a preferred extension then R3 in Section 5.1 also holds for semi-stable labellings L .  ... 
doi:10.1007/978-0-387-98197-0_6 fatcat:kc5vqztg7badff4nzhvv2xkkwq

Page 3295 of Mathematical Reviews Vol. , Issue 2004d [page]

2004 Mathematical Reviews  
Sci. 237 (2000), no. 1-2, 159-181; MR 2001f:68025] presented an asymptotically efficient algorithm for stable merging in constant extra space.  ...  An efficient algorithm is provided to check whether a given semi- algebraic set satisfies a property expressed in this “path logic”.  ... 

A new method for multidimensional optimization and its application in image and video processing

D. Schonfeld, N. Bouaynaya
2006 IEEE Signal Processing Letters  
We subsequently propose an extension of the Viterbi algorithm to semi-causal, multidimensional functions.  ...  This approach is based on extension of the 1-D trellis structure of the Viterbi algorithm to a tree structure in higher dimensions.  ...  Forney for his comments.  ... 
doi:10.1109/lsp.2006.873142 fatcat:v7x7nudvqjdybimqlafxgrlfqa

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.  ...  Establishing the theoretical foundations of this approach, we derive several new complexity results for preferred, semi-stable and stage semantics which complement the current complexity landscape for  ...  Moreover, in case an AF has at least one stable extension, its stable, semi-stable, and respectively, stage extensions coincide.  ... 
doi:10.1016/j.artint.2013.10.001 fatcat:jlc67qtkvbaixfihkgryslxt5e

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.  ...  subtracks (PYGLAF for the preferred and semi-stable semantics, and ASPARTIX for the stage semantics).  ... 
arXiv:2109.08884v2 fatcat:zu7rhb5hxnflle6ll4ejsspmky

Enumerating Extensions on Random Abstract-AFs with ArgTools, Aspartix, ConArg2, and Dung-O-Matic [chapter]

Stefano Bistarelli, Fabio Rossi, Francesco Santini
2014 Lecture Notes in Computer Science  
Intuitively, an acceptable set of arguments must be in some sense coherent (no attacks among its arguments, i.e., conflict-free) and strong enough (for instance, able to defend itself against all attacking  ...  This will be part of the extensive future work we plan to investigate by elaborating on our tool and these tests (see Sec. 7).  ...  Such algorithms are concerned with enumerating all extensions of an AAF under different semantics: preferred, stable, complete, semi stable, stage, ideal and grounded.  ... 
doi:10.1007/978-3-319-09764-0_5 fatcat:njwrc6hvpfamfbgvan6z5zexv4

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  
Complementing the complexity results, we propose algorithms for NP-hard extension enforcement based on constraint optimization under the maximum satisfiability (MaxSAT) paradigm.  ...  We provide a nearly complete computational complexity map of argument-fixed extension enforcement under various major AF semantics, with results ranging from polynomial-time algorithms to completeness  ...  under preferred and semi-stable semantics as well as for nonstrict semi-stable and stage semantics. • We propose algorithms for the NP-hard variants of the enforcement problems based on applying constraint  ... 
doi:10.1613/jair.5415 fatcat:dfcx5xtnnvdkpiqwhglf4z64hy

Page 6032 of Mathematical Reviews Vol. , Issue 94j [page]

1994 Mathematical Reviews  
A stable nonnegative numerical method for computations of the flow of a fluid in an open channel. (Russian. Russian summary) Zh. Vychisl. Mat. i Mat.  ...  It is a cheap way to improve existing 1D semi-Lagrangian codes and allows stable calculations beyond the usual CFL limits. A basic  ... 

Page 4181 of Mathematical Reviews Vol. , Issue 2001F [page]

2001 Mathematical Reviews  
The authors exploit known techniques to design efficient so- lutions for the in-place, stable and not stable problem.  ...  These solutions achieve an almost optimal number of comparisons (m(t + 1)+n/2'+0(m) where t = |log,(n/m)|) and a non- optimal number of moves (3n + 3m + o0(m) for the semi-stable case and 15n + 15m+o(m  ... 

Default Logic and Bounded Treewidth [article]

Johannes K. Fichte, Markus Hecher, Irina Schindler
2017 arXiv   pre-print
Our algorithm can even be used to enumerate all generating defaults (ExtEnum) that lead to stable extensions.  ...  We establish a dynamic programming algorithm on tree decompositions that decides whether a theory has a consistent stable extension (Ext).  ...  For Case (ii) the stable extension consists of all formulas. Therefore, we consider only consistent stable extensions.  ... 
arXiv:1706.09393v2 fatcat:o2cx3p2mizd3lkc7j5cyp2whrq
« Previous Showing results 1 — 15 out of 84,814 results