Augmenting tractable fragments of abstract argumentation

Artificial Intelligence

Volumn 186, Issue , 2012, Pages 157-173

  Dvořák, Wolfgang ^a   Ordyniak, Sebastian ^a   Szeider, Stefan ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Abstract argumentation; Backdoors; Computational complexity; Fixed parameter tractability; Parameterized complexity

Indexed keywords

ABSTRACT ARGUMENTATION; ARGUMENTATION FRAMEWORKS; BACKDOORS; COMPUTATIONAL COSTS; COMPUTATIONAL PROBLEM; FIXED-PARAMETER TRACTABILITY; PARAMETERIZED; PARAMETERIZED COMPLEXITY;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; SEMANTICS;

PROBLEM SOLVING;

EID: 84860756734     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2012.03.002     Document Type: Article

References (42)

1. P. Baroni, P.E. Dunne, and M. Giacomin On the resolution-based family of abstract argumentation semantics and its grounded instance Artificial Intelligence 175 2011 791 813
2. P. Baroni, and M. Giacomin Semantics of abstract argument systems I. Rahwan, G. Simari, Argumentation in Artificial Intelligence 2009 Springer Verlag 25 44
3. T.J.M. Bench-Capon, and P.E. Dunne Argumentation in artificial intelligence Artificial Intelligence 171 2007 619 641
4. P. Besnard, and A. Hunter Elements of Argumentation 2008 The MIT Press
5. A. Bondarenko, P.M. Dung, R.A. Kowalski, and F. Toni An abstract, argumentation-theoretic approach to default reasoning Artificial Intelligence 93 1997 63 101
6. M. Caminada On the issue of reinstatement in argumentation M. Fisher, W. van der Hoek, B. Konev, A. Lisitsa, Logics in Artificial Intelligence, Proceedings of the 10th European Conference, JELIA 2006 Liverpool, UK, September 13-15, 2006 Lecture Notes in Computer Science vol. 4160 2006 Springer Verlag 111 123
7. M. Caminada Semi-stable semantics P.E. Dunne, T.J.M. Bench-Capon, Proceedings of the 1st Conference on Computational Models of Argument (COMMA 2006) Frontiers in Artificial Intelligence and Applications vol. 144 2006 IOS Press 121 130
8. M. Caminada, and D.M. Gabbay A logical account of formal argumentation Studia Logica 93 2009 109 145
9. J. Chen, Y. Liu, S. Lu, B. O Sullivan, and I. Razgon A fixed-parameter algorithm for the directed feedback vertex set problem J. ACM 55 2008 Art. 21, 19
10. S. Coste-Marquis, C. Devred, and P. Marquis Symmetric argumentation frameworks L. Godo, Symbolic and Quantitative Approaches to Reasoning with Uncertainty, Proceedings of the 8th European Conference, ECSQARU 2005 Barcelona, Spain, July 6-8, 2005 Lecture Notes in Computer Science vol. 3571 2005 Springer Verlag 317 328
11. Y. Dimopoulos, and A. Torres Graph theoretical structures in logic programs and default theories Theoret. Comput. Sci. 170 1996 209 244
12. R.G. Downey, and M.R. Fellows Parameterized Complexity Monographs in Computer Science 1999 Springer-Verlag New York
13. P.M. Dung On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games Artificial Intelligence 77 1995 321 357
14. P.E. Dunne Computational properties of argument systems satisfying graph-theoretic constraints Artificial Intelligence 171 2007 701 729
15. P.E. Dunne, T.J.M. Bench-Capon, Complexity and combinatorial properties of argument systems, Technical Report, University of Liverpool, 2001.
16. P.E. Dunne, and T.J.M. Bench-Capon Coherence in finite argument systems Artificial Intelligence 141 2002 187 203
17. P.E. Dunne, and M. Caminada Computational complexity of semi-stable semantics in abstract argumentation frameworks S. Hölldobler, C. Lutz, H. Wansing, Proceedings of the 11th European Conference on Logics in Artificial Intelligence JELIA 2008 Lecture Notes in Computer Science vol. 5293 2008 Springer 153 165
18. P.E. Dunne, and M. Wooldridge Complexity of abstract argumentation G. Simari, I. Rahwan, Argumentation in Artificial Intelligence 2009 Springer US 85 104
19. W. Dvořák, and S. Woltran Complexity of semi-stable and stage semantics in argumentation frameworks Inform. Process. Lett. 110 2010 425 430
20. W. Dvořák, and S. Woltran On the intertranslatability of argumentation semantics J. Artif. Intell. Res. 41 2011 445 475
21. W. Dvořák Technical note: Exploring Σ 2 P / Π 2 P -hardness for argumentation problems with fixed distance to tractable classes, CoRR arXiv:1201.0478 [cs.AI] 2012
22. W. Dvořák, R. Pichler, and S. Woltran Towards fixed-parameter tractable algorithms for abstract argumentation Artificial Intelligence 186 2012 1 37 10.1016/j.artint.2012.03.005
23. W. Dvořák, S. Szeider, and S. Woltran Reasoning in argumentation frameworks of bounded clique-width P. Baroni, F. Cerutti, M. Giacomin, G.R. Simari, Computational Models of Argumentation, Proceedings of COMMA 2010 Frontiers in Artificial Intelligence and Applications vol. 216 2010 IOS 219 230
24. J.K. Fichte, S. Szeider, Backdoors to tractable answer-set programming, in: T. Walsh (Ed.), IJCAI, 2011 Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011, pp. 863-868.
25. J. Flum, and M. Grohe Parameterized Complexity Theory Texts in Theoretical Computer Science, An EATCS Series vol. XIV 2006 Springer-Verlag Berlin
26. M.R. Garey, and D.R. Johnson Computers and Intractability 1979 W.H. Freeman and Company New York, San Francisco
27. S. Gaspers, and S. Szeider Backdoors to satisfaction, CoRR arXiv:1110.6387 [cs.DS] 2011
28. G. Gottlob, and S. Szeider Fixed-parameter algorithms for artificial intelligence, constraint satisfaction, and database problems Comput. J. 51 2006 303 325 Survey paper
29. H. Jakobovits, and D. Vermeir Robust semantics for argumentation frameworks J. Logic Comput. 9 1999 215 261
30. S. Modgil, and M. Caminada Proof theories and algorithms for abstract argumentation frameworks I. Rahwan, G. Simari, Argumentation in Artificial Intelligence 2009 Springer-Verlag 105 132
31. R. Niedermeier Invitation to Fixed-Parameter Algorithms Oxford Lecture Series in Mathematics and its Applications 2006 Oxford University Press Oxford
32. C.H. Papadimitriou Computational Complexity 1994 Addison-Wesley
33. S. Parsons, M. Wooldridge, and L. Amgoud Properties and complexity of some formal inter-agent dialogues J. Logic Comput. 13 2003 347 376
34. J.L. Pollock How to reason defeasibly Artificial Intelligence 57 1992 1 42
35. I. Rahwan, and G.R. Simari Argumentation in Artificial Intelligence 2009 Springer Verlag
36. B. Reed, K. Smith, and A. Vetta Finding odd cycle transversals Oper. Res. Lett. 32 2004 299 301
37. N. Robertson, P.D. Seymour, and R. Thomas Permanents, Pfaffian orientations, and even directed circuits Ann. of Math. (2) 150 1999 929 975
38. M. Samer, and S. Szeider Backdoor sets of quantified Boolean formulas J. Automat. Reason. 42 2009 77 97
39. M. Samer, and S. Szeider Fixed-parameter tractability A. Biere, M. Heule, H. van Maaren, T. Walsh, Handbook of Satisfiability 2009 IOS Press 425 454
40. B. Verheij, Two approaches to dialectical argumentation: admissible sets and argumentation stages, in: Proceedings of the 8th Dutch Conference on Artificial Intelligence (NAIC 96), pp. 357-368.
41. B. Verheij, A labeling approach to the computation of credulous acceptance in argumentation, in: M.M. Veloso (Ed.), Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 623-628.
42. R. Williams, C. Gomes, and B. Selman Backdoors to typical case complexity G. Gottlob, T. Walsh, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI 2003 2003 Morgan Kaufmann 1173 1178