Complexity Properties of Restricted Abstract Argument Systems

Frontiers in Artificial Intelligence and Applications

Volumn 144, Issue , 2006, Pages 85-96

  Dunne, Paul E ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

argumentation frameworks; computational complexity; Computational properties of argumentation

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIAL APPROXIMATION;

ABSTRACT ARGUMENTS; ARGUMENT SYSTEMS; ARGUMENTATION FRAMEWORKS; BIPARTITE GRAPHS; CLASSIFIEDS; COMPUTATIONAL PROPERTIES; COMPUTATIONAL PROPERTY OF ARGUMENTATION; DECISION PROCESS; GRAPH THEORETICS; PROPERTY;

SEMANTICS;

EID: 34548034784     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (16)

1. P. M. Dung. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence, 77:321-357, 1995.
2. A. Bondarenko, P.M. Dung, R.A. Kowalski, and F. Toni. An abstract, argumentation-theoretic approach to default reasoning. Artificial Intelligence, 93:63-101, 1997.
3. Y. Dimopoulos, B. Nebel, and F. Toni. On the computational complexity of assumption-based argumentation for default reasoning. Artificial Intelligence, 141:55-78, 2002.
4. Y. Dimopoulos and A. Torres. Graph theoretical structures in logic programs and default theories. Theoretical Computer Science, 170:209-244, 1996.
5. P. E. Dunne and T. J. M. Bench-Capon. Coherence in finite argument systems. Artificial Intelligence, 141:187-203, 2002.
6. S. Coste-Marquis, C. Devred, and P. Marquis. Symmetric argumentation frameworks. In L. Godo, editor, Proc. 8th European Conf. on Symbolic and Quantitative Approaches to Reasoning With Uncertainty (ECSQARU), volume 3571 of LNAI, pages 317-328. Springer-Verlag, 2005.
7. P. Baroni and M. Giacomin. Solving semantic problems with odd-length cycles in argumentation. In Proc. 7th European Conf. on Symbolic and Quantitative Approaches to Reasoning With Uncertainty (ECSQARU), volume 2711 of LNAI, pages 440-451. Springer-Verlag, 2003.
8. P. Baroni, M. Giacomin, and G. Guida. SCC-recursiveness: a general schema for argumentation semantics. Artificial Intelligence, 168(1-2):162-210, 2005.
9. L. Amgoud and C. Cayrol. A reasoning model based on the production of acceptable arguments. Annals of Math. and Artificial Intelligence, 34:197-215, 2002.
10. T. J. M. Bench-Capon. Persuasion in Practical Argument Using Value-based Argumentation Frameworks. Journal of Logic and Computation, 13(3):429-448, 2003.
11. G. Vreeswijk and H. Prakken. Credulous and sceptical argument games for preferred semantics. In Proceedings of JELIA'2000, The 7th European Workshop on Logic for Artificial Intelligence., pages 224-238, Berlin, 2000. Springer LNAI 1919, Springer Verlag.
12. P. E. Dunne and T. J. M. Bench-Capon. Complexity in value-based argument systems. In Proc. 9th JELIA, volume 3229 of LNAI, pages 360-371. Springer-Verlag, 2004.
13. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman: New York, 1979.
14. P. E. Dunne and T. J. M. Bench-Capon. Two party immediate response disputes: properties and efficiency. Artificial Intelligence, 149:221-250, 2003.
15. T. J. M. Bench-Capon, S. Doutre, and P. E. Dunne. Audiences in argumentation frameworks. Technical Report ULCS-05-012, Department of Computer Science, Univ. of Liverpool, December 2005.
16. C. Berge. Graphs and Hypergraphs. North-Holland, Amsterdam, 1973.