26 found
Order:
  1.  9
    Complexity-sensitive decision procedures for abstract argumentation.Wolfgang Dvořák, Matti Järvisalo, Johannes Peter Wallner & Stefan Woltran - 2014 - Artificial Intelligence 206 (C):53-78.
  2.  8
    Characteristics of multiple viewpoints in abstract argumentation.Paul E. Dunne, Wolfgang Dvořák, Thomas Linsbichler & Stefan Woltran - 2015 - Artificial Intelligence 228 (C):153-178.
  3.  11
    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 220 (C):28-63.
  4.  7
    Choice logics and their computational properties.Michael Bernreiter, Jan Maly & Stefan Woltran - 2022 - Artificial Intelligence 311 (C):103755.
  5.  6
    Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving.Thomas Linsbichler, Marco Maratea, Andreas Niskanen, Johannes P. Wallner & Stefan Woltran - 2022 - Artificial Intelligence 307 (C):103697.
  6.  51
    Answer-set programming encodings for argumentation frameworks.Uwe Egly, Sarah Alice Gaggl & Stefan Woltran - 2010 - Argument and Computation 1 (2):147-177.
    Answer-set programming (ASP) has emerged as a declarative programming paradigm where problems are encoded as logic programs, such that the so-called answer sets of theses programs represent the solutions of the encoded problem. The efficiency of the latest ASP solvers reached a state that makes them applicable for problems of practical importance. Consequently, problems from many different areas, including diagnosis, data integration, and graph theory, have been successfully tackled via ASP. In this work, we present such ASP-encodings for problems associated (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  7.  4
    Complexity of abstract argumentation under a claim-centric view.Wolfgang Dvořák & Stefan Woltran - 2020 - Artificial Intelligence 285 (C):103290.
  8.  4
    Characterizing strong equivalence for argumentation frameworks.Emilia Oikarinen & Stefan Woltran - 2011 - Artificial Intelligence 175 (14-15):1985-2009.
  9.  3
    Towards fixed-parameter tractable algorithms for abstract argumentation.Wolfgang Dvořák, Reinhard Pichler & Stefan Woltran - 2012 - Artificial Intelligence 186 (C):1-37.
  10.  11
    On the expressive power of collective attacks.Wolfgang Dvořák, Jorge Fandinno & Stefan Woltran - 2019 - Argument and Computation 10 (2):191-230.
  11.  3
    The complexity landscape of claim-augmented argumentation frameworks.Wolfgang Dvořák, Alexander Greßler, Anna Rapberger & Stefan Woltran - 2023 - Artificial Intelligence 317 (C):103873.
  12.  3
    On rejected arguments and implicit conflicts: The hidden power of argumentation semantics.Ringo Baumann, Wolfgang Dvořák, Thomas Linsbichler, Christof Spanring, Hannes Strass & Stefan Woltran - 2016 - Artificial Intelligence 241 (C):244-284.
  13.  13
    Investigating subclasses of abstract dialectical frameworks.Martin Diller, Atefeh Keshavarzi Zafarghandi, Thomas Linsbichler & Stefan Woltran - 2020 - Argument and Computation 11 (1-2):191-219.
  14.  13
    Design and results of the Second International Competition on Computational Models of Argumentation.Sarah A. Gaggl, Thomas Linsbichler, Marco Maratea & Stefan Woltran - 2020 - Artificial Intelligence 279 (C):103193.
  15.  4
    A claim-centric perspective on abstract argumentation semantics: Claim-defeat, principles, and expressiveness.Wolfgang Dvořák, Anna Rapberger & Stefan Woltran - 2023 - Artificial Intelligence 324 (C):104011.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16.  4
    A general notion of equivalence for abstract argumentation.Ringo Baumann, Wolfgang Dvořák, Thomas Linsbichler & Stefan Woltran - 2019 - Artificial Intelligence 275 (C):379-410.
  17.  4
    Parametric properties of ideal semantics.Paul E. Dunne, Wolfgang Dvořák & Stefan Woltran - 2013 - Artificial Intelligence 202 (C):1-28.
  18.  43
    Reasoning in abstract dialectical frameworks using quantified Boolean formulas.Martin Diller, Johannes Peter Wallner & Stefan Woltran - 2015 - Argument and Computation 6 (2):149-177.
    dialectical frameworks constitute a recent and powerful generalisation of Dung's argumentation frameworks, where the relationship between the arguments can be specified via Boolean formulas. Recent results have shown that this enhancement comes with the price of higher complexity compared to AFs. In fact, acceptance problems in the world of ADFs can be hard even for the third level of the polynomial hierarchy. In order to implement reasoning problems on ADFs, systems for quantified Boolean formulas thus are suitable engines to be (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  19.  3
    Encoding deductive argumentation in quantified Boolean formulae.Philippe Besnard, Anthony Hunter & Stefan Woltran - 2009 - Artificial Intelligence 173 (15):1406-1423.
  20.  8
    Model-based recasting in answer-set programming.Thomas Eiter, Michael Fink, Jörg Pührer, Hans Tompits & Stefan Woltran - 2013 - Journal of Applied Non-Classical Logics 23 (1-2):75-104.
    As is well known, answer-set programs do not satisfy the replacement property in general, i.e., programs and that are equivalent may cease to be so when they are put in the context of some other program, i.e., and may have different answer sets. Lifschitz, Pearce, and Valverde thus introduced strong equivalence for context-independent equivalence, and proved that such equivalence holds between given programs and iff and are equivalent theories in the monotonic logic of here-and-there. In this article, we consider a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  4
    Abstract argumentation with conditional preferences.Michael Bernreiter, Wolfgang Dvořák & Stefan Woltran - forthcoming - Argument and Computation:1-29.
    In this paper, we study conditional preferences in abstract argumentation by introducing a new generalization of Dung-style argumentation frameworks (AFs) called Conditional Preference-based AFs (CPAFs). Each subset of arguments in a CPAF can be associated with its own preference relation. This generalizes existing approaches for preference-handling in abstract argumentation, and allows us to reason about conditional preferences in a general way. We conduct a principle-based analysis of CPAFs and compare them to related generalizations of AFs. Specifically, we highlight similarities and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  22.  19
    Abstract solvers for Dung’s argumentation frameworks.Remi Brochenin, Thomas Linsbichler, Marco Maratea, Johannes P. Wallner & Stefan Woltran - 2018 - Argument and Computation 9 (1):41-72.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  23.  16
    Complexity of logic-based argumentation in Post's framework.Nadia Creignou, Johannes Schmidt, Michael Thomas & Stefan Woltran - 2011 - Argument and Computation 2 (2-3):107 - 129.
    Many proposals for logic-based formalisations of argumentation consider an argument as a pair (Φ,α), where the support Φ is understood as a minimal consistent subset of a given knowledge base which has to entail the claim α. In case the arguments are given in the full language of classical propositional logic reasoning in such frameworks becomes a computationally costly task. For instance, the problem of deciding whether there exists a support for a given claim has been shown to be -complete. (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  24.  12
    Solving Projected Model Counting by Utilizing Treewidth and its Limits.Johannes K. Fichte, Markus Hecher, Michael Morak, Patrick Thier & Stefan Woltran - 2023 - Artificial Intelligence 314 (C):103810.
  25.  7
    On the limits of forgetting in Answer Set Programming.Ricardo Gonçalves, Matthias Knorr, João Leite & Stefan Woltran - 2020 - Artificial Intelligence 286 (C):103307.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  26.  18
    Applications of logical approaches to argumentation.João Leite, Tran Cao Son, Paolo Torroni & Stefan Woltran - 2015 - Argument and Computation 6 (1):1-2.