Augmenting tractable fragments of abstract argumentation

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 1033-1038

  Ordyniak, Sebastian ^a   Szeider, Stefan ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

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

ALGORITHMS; SEMANTICS;

PROBLEM SOLVING;

EID: 84864123686     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-177     Document Type: Conference Paper

References (28)

1. P. Baroni and M. Giacomin. Semantics of abstract argument systems. In I. Rahwan and G. Simari, eds, Argumentation in Artificial Intelligence, pages 25-44. Springer Verlag, 2009.
2. T. J. M. Bench-Capon and P. E. Dunne. Argumentation in artificial intelligence. Artificial Intelligence, 171(10-15):619-641, 2007.
3. P. Besnard and A. Hunter. Elements of Argumentation. The MIT Press, 2008.
4. A. Bondarenko, P. M. Dung, R. A. Kowalski, and F. Toni. An abstract, argumentation-theoretic approach to default reasoning. Artificial Intelligence, 93(1-2):63-101, 1997. (Pubitemid 127401113)
5. 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(5):Art. 21, 19, 2008.
6. S. Coste-Marquis, C. Devred, and P. Marquis. Symmetric argumentation frameworks. In L. Godo, ed., ECSQARU 2005, LNCS 3571, 317-328. Springer, 2005.
7. Y. Dimopoulos and A. Torres. Graph theoretical structures in logic programs and default theories. Theoret. Comput. Sci., 170(1-2):209-244, 1996. (Pubitemid 126411634)
8. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
9. Ph. M. Dung. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence, 77(2):321-357, 1995.
10. P. E. Dunne and T. J. M. Bench-Capon. Complexity and combinatorial properties of argument systems. Technical report, University of Liverpool, 2001.
11. P. E. Dunne and T. J. M. Bench-Capon. Coherence in finite argument systems. Artificial Intelligence, 141(1-2):187-203, 2002.
12. P. E. Dunne. Computational properties of argument systems satisfying graph-theoretic constraints. Artificial Intelligence, 171(10-15):701-729, 2007.
13. W. Dvořák and S. Woltran. On the intertranslatability of argumentation semantics. In Conference on Thirty Years of Nonmonotonic Reasoning (NonMon@30), Lexington, KY, USA, 2010.
14. W. Dvořák, S. Szeider, and S. Woltran. Reasoning in argumentation frameworks of bounded clique-width. In P. Baroni, F. Cerutti, M. Giacomin, and G. R. Simari, eds., COMMA 2010, volume 216 of Frontiers in Artificial Intelligence and Applications, pages 219-230. IOS, 2010.
15. J. K. Fichte and S. Szeider. Backdoors to tractable answer-set programming. In IJCAI 2011, 2011.
16. J. Flum and M. Grohe. Parameterized Complexity Theory, volume XIV of Texts in Theoretical Computer Science. An EATCS Series. Springer Verlag, Berlin, 2006.
17. M. R. Garey and D. R. Johnson. Computers and Intractability. W. H. Freeman and Company, New York, San Francisco, 1979.
18. G. Gottlob and S. Szeider. Fixedparameter algorithms for artificial intelligence, constraint satisfaction, and database problems. The Computer Journal, 51(3):303-325, 2006.
19. S. Modgil and M. Caminada. Proof theories and algorithms for abstract argumentation frameworks. In I. Rahwan and G. Simari, eds., Argumentation in Artificial Intelligence, pages 105-132. Springer, 2009.
20. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications. Oxford University Press, Oxford, 2006.
21. S. Parsons, M. Wooldridge, and L. Amgoud. Properties and complexity of some formal inter-agent dialogues. J. Logic Comput., 13(3):347-376, 2003.
22. J. L. Pollock. How to reason defeasibly. Artificial Intelligence, 57(1):1-42, 1992.
23. I. Rahwan and G. R. Simari, eds. Argumentation in Artificial Intelligence. Springer, 2009.
24. B. Reed, K. Smith, and A. Vetta. Finding odd cycle transversals. Oper. Res. Lett., 32(4):299-301, 2004.
25. N. Robertson, P. D. Seymour, and R. Thomas. Permanents, Pfaffian orientations, and even directed circuits. Ann. of Math. (2), 150(3):929-975, 1999.
26. M. Samer and S. Szeider. Fixedparameter tractability. In A. Biere, M. Heule, H. van Maaren, and T. Walsh, editors, Handbook of Satisfiability, chapter 13, pages 425-454. IOS Press, 2009.
27. M. Samer and S. Szeider. Backdoor sets of quantified Boolean formulas. Journal of Automated Reasoning, 42(1):77-97, 2009.
28. R. Williams, C. Gomes, and B. Selman. Backdoors to typical case complexity. In G. Gottlob and T. Walsh, eds, IJCAI 2003, pages 1173-1178, 2003.