Theoretical and computational properties of preference-based argumentation

Frontiers in Artificial Intelligence and Applications

Volumn 178, Issue , 2008, Pages 463-467

  Dimopoulos, Yannis ^a   Moraitis, Pavlos ^b   Amgoud, Leila ^c  

^a UNIVERSITY OF CYPRUS   (Cyprus)

^b UNIVERSITÉ PARIS DESCARTES   (France)

^c UNIVERSITÉ PAUL SABATIER   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS;

ARGUMENTATION FRAMEWORKS; COMPUTATIONAL PROPERTIES; PREFERENCE RELATION; PREFERENCE-BASED; PROPERTY; REASONING PROBLEMS; REASONING TASKS;

PROBLEM SOLVING;

EID: 84883431871     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-463     Document Type: Conference Paper

References (14)

1. L. Amgoud and C. Cayrol, ‘On the acceptability of arguments in preference-based argumentation framework’, in Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, pp. 1–7, (1998).
2. L. Amgoud, Y. Dimopoulos, and P. Moraitis, ‘A Unified and General Framework for Argumentation-based Negotiation’, in Proc. 7th International Joint Conference on Autonomous Agents and Multi-Agent Systems, pp. 963–970. ACM Press, (2007).
3. L. Amgoud and H. Prade, ‘Explaining qualitative decision under uncertainty by argumentation’, in 21st National Conference on Artificial Intelligence, AAAI’06, pp. 16 – 20, (2006).
4. T. Bench-Capon and P. Dunne, ‘Argumentation in artificial intelligence’, Artif. Intell., 171(10-15), 619–641, (2007).
5. T. J. M. Bench-Capon, ‘Persuasion in practical argument using value-based argumentation frameworks’, Journal of Logic and Computation, 13(3), 429–448, (2003).
6. S. Doutre, Autour de la sémantique préférée des systèmes d’argumentation, PhD thesis, Université Paul Sabatier, Toulouse – France., 2002.
7. P. Duchet, Représentations, Noyaux en Théorie des Graphes et Hyper-graphes, PhD thesis, 1979.
8. 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).
9. P. Dunne, ‘Computational properties of argument systems satisfying graph-theoretic constraints’, Artif. Intell., 171(10-15), 701–729, (2007).
10. P. Dunne and T. Bench Capon, ‘Coherence in finite argument systems’, Artificial Intelligence, 141 (1–2), 187–203, (2002).
11. D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis, ‘On generating all maximal independent sets’, Inf. Process. Lett., 27(3), 119–123, (1988).
12. A. Kakas and P. Moraitis, ‘Argumentation based decision making for autonomous agents’, in Proc. 2nd International Joint Conference on Autonomous Agents and Multi-Agents Systems, pp. 883–890, (2003).
13. J. Moon and L. Moser, ‘On cliques in graphs’, Israel Journal of Mathematics, 3, 23–28, (1965).
14. H. Prakken and G. Sartor, ‘Argument-based extended logic programming with defeasible priorities’, Journal of Applied Non-Classical Log-ics, 7, 25–75, (1997).