Complexity of semi-stable and stage semantics in argumentation frameworks

Information Processing Letters

Volumn 110, Issue 11, 2010, Pages 425-430

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

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Abstract argumentation; Computational complexity

Indexed keywords

COMPUTATIONAL COMPLEXITY; SEMANTICS;

ABSTRACT ARGUMENTATION; ARGUMENTATION FRAMEWORKS; COMPLEXITY BOUNDS; DECISION PROBLEMS; STABLE SEMANTICS;

PROBLEM SOLVING;

EID: 78650949569     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2010.04.005     Document Type: Article

References (18)

1. Pietro Baroni, Massimiliano Giacomin, Semantics of abstract argument systems, in: I. Rahwan, G. Simari (Eds.), Argumentation in Artificial Intelligence, Springer, 2009, pp. 25-44.
2. Paul E. Dunne, Trevor J.M. Bench-Capon (Eds.), Proceedings of the 1st Conference on Computational Models of Argument (COMMA 2006), IOS Press
3. Trevor J.M. Bench-Capon, Paul E. Dunne, Argumentation in artificial intelligence, Artificial Intelligence 171 (10-15) (2007) 619-641. (Pubitemid 47285079)
4. Martin Caminada, Semi-stable semantics, in: Paul E. Dunne, Trevor J.M. Bench-Capon (Eds.), Proceedings of the 1st Conference on Computational Models of Argument (COMMA 2006), in: Frontiers Artificial Intelligence Appl., vol. 144, IOS Press, 2006, pp. 121-130.
5. Bruno Courcelle, Graph rewriting: An algebraic and logic approach, in: Handbook of Theoretical Computer Science (B): Formal Models and Semantics, Elsevier, 1990, pp. 193-242.
6. Phan Minh Dung, On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games, Artificial Intelligence 77 (2) (1995) 321-358.
7. Paul E. Dunne, Computational properties of argument systems satisfying graph-theoretic constraints, Artificial Intelligence 171 (10-15) (2007) 701-729. (Pubitemid 47285069)
8. Paul E. Dunne, The computational complexity of ideal semantics, Artificial Intelligence 173 (18) (2009) 1559-1591.
9. Paul E. Dunne, Trevor J.M. Bench-Capon, Coherence in finite argument systems, Artificial Intelligence 141 (1-2) (2002) 187-203.
10. Paul E. Dunne, Martin Caminada, Computational complexity of semistable semantics in abstract argumentation frameworks, in: Steffen Holldobler, Carsten Lutz, Heinrich Wansing (Eds.), Proceedings of the 11th European Conference on Logics in Artificial Intelligence (JELIA 2008), in: LNCS, vol. 5293, Springer, 2008, pp. 153-165.
11. Paul E. Dunne, Michael Wooldridge, Complexity of abstract argumentation, in: I. Rahwan, G. Simari (Eds.), Argumentation in Artificial Intelligence, Springer, 2009, pp. 85-104.
12. Lawrence C. Eggan, Transition graphs and the star height of regular events, Michigan Math. J. 10 (1963) 385-397.
13. Jorg Flum, Martin Grohe, Parameterized Complexity Theory, Springer, 2006.
14. Hermann Gruber, Digraph complexity measures and applications in formal language theory, in: Proceedings of the 4th Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2008), 2008, pp. 60-67.
15. Paul Hunter, Stephan Kreutzer, Digraph measures: Kelly decompositions, games, and orderings, Theoret. Comput. Sci. 399 (3) (2008) 206-219.
16. Paul William Hunter, Complexity and infinite games on finite graphs, Technical Report UCAM-CL-TR-704, University of Cambridge, November 2007.
17. Neil Robertson, Paul D. Seymour, Graph minors. III. Planar tree-width, J. Combin. Theory Ser. B 36 (1) (1984) 49-64.
18. Bart Verheij, Two approaches to dialectical argumentation: Admissible sets and argumentation stages, in: J. Meyer, L. van der Gaag (Eds.), Proceedings of the 8th Dutch Conference on Artificial Intelligence (NAIC'96), 1996, pp. 357-368.