Reasoning in argumentation frameworks of bounded clique-width

Frontiers in Artificial Intelligence and Applications

Volumn 216, Issue , 2010, Pages 219-230

  Dvořák, Wolfgang ^a   Szeider, Stefan ^a   Woltran, Stefan ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Clique Width; Computational Properties of Argumentation; Fixed Parameter Tractability

Indexed keywords

COMPUTATIONAL EFFICIENCY; DYNAMIC PROGRAMMING; PROBLEM SOLVING;

ABSTRACT ARGUMENTATION; ARGUMENTATION FRAMEWORKS; ARGUMENTATION SYSTEMS; CLIQUE-WIDTH; COMPUTATIONAL PROBLEM; COMPUTATIONAL PROPERTIES; COMPUTATIONAL PROPERTY OF ARGUMENTATION; FIXED-PARAMETER TRACTABILITY; GRAPH PARAMETERS; TREE-WIDTH;

DIRECTED GRAPHS;

EID: 78049241169     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-60750-619-5-219     Document Type: Conference Paper

References (20)

1. S. Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods, 2(2):277-284, 1987.
2. T. J. M. Bench-Capon and P. E. Dunne. Argumentation in artificial intelligence. Artificial Intelligence, 171 (10-15): 619-641, 2007.
3. H. L. Bodlaender. On linear time minor tests with depth-first search. J. Algorithms, 1(1):1-23, 1993.
4. H. L. Bodlaender. A tourist guide through treewidth. Acta Cybernetica, 11:1-21, 1993.
5. D. G. Corneil and U. Rotics. On the relationship between clique-width and treewidth. SIAM J. Comput., 4(4):825-847, 2005.
6. S. Coste-Marquis, C. Devred, and P. Marquis. Symmetric argumentation frameworks. In Proc. ECSQARU'05, volume 3571 of LNCS, pages 317-328. Springer, 2005.
7. B. Courcelle. Recognizability and second-order definability for sets of finite graphs. Technical Report I-8634, Université de Bordeaux, 1987.
8. B. Courcelle. Graph rewriting: an algebraic and logic approach. In Handbook of Theoretical Computer Science, Vol. B, pages 193-242. Elsevier Science Publishers 1990.
9. B. Courcelle, J. Engelfriet, and G. Rozenberg. Context-free handle-rewriting hypergraph grammars. In Proc. Graph Grammars 1990, volume 532 of LNCS, pages 253-268. Springer, 1991.
10. B. Courcelle, J. Engelfriet, and G. Rozenberg. Handle-rewriting hypergraph grammars. J. of Computer and System Sciences, 2(2):218-270, 1993.
11. B. Courcelle, J. A. Makowsky, and U. Rotics. Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst., 2(2):125-150, 2000.
12. B. Courcelle and S. Olariu. Upper bounds to the clique-width of graphs. Discr. Appl. Math., 101 (1-3): 77-114, 2000.
13. Y. Dimopoulos and A. Torres. Graph theoretical structures in logic programs and default theories. Theoret. Comput. Sci., 170 (1-2): 209-244, 1996.
14. P. M. Dung. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence, 2(2):321-358, 1995.
15. P. E. Dunne. Computational properties of argument systems satisfying graph-theoretic constraints. Artificial Intelligence, 171 (10-15): 701-729, 2007.
16. P. E. Dunne and T. J. M. Bench-Capon. Coherence in finite argument systems. Artificial Intelligence, 141 (1/2): 187-203, 2002.
17. W. Dvǒrák, R. Pichler, and S. Woltran. Towards fixed-parameter tractable algorithms for argumentation. In Proc. KR'10, pages 112-122. AAAI Press, 2010
18. M. R. Fellows, F. A. Rosamond, U. Rotics, and S. Szeider. Clique-width is NP-complete. SIAM J. Discrete Math., 2(2):909-939, 2009.
19. M. M. Kanté. The rank-width of directed graphs. CoRR, abs/0709.1433, 2007.
20. S. Oum and P. Seymour. Approximating clique-width and branch-width. J. Combin. Theory Ser. B, 4(4):514-528, 2006.