Symmetric argumentation frameworks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3571 LNAI, Issue , 2005, Pages 317-328

  Coste Marquis, Sylvie ^a   Devred, Caroline ^a   Marquis, Pierre ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

PROBLEM SOLVING; SEMANTICS; UNCERTAIN SYSTEMS;

ACCEPTABILITY; ACCEPTABILITY PROBLEMS; FINITE ARGUMENTATION FRAMEWORKS;

INFORMATION ANALYSIS;

EID: 26944492173     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11518655_28     Document Type: Conference Paper

References (27)

1. Toulmin, S.: The Uses of Argument. Cambridge University Press (1958)
2. Prakken, A., Vreeswijk, G.: Logics for defeasible argumentation. Volume 4 of Handbook of Philosophical Logic, Second edition. Kluwer Academic Publishers (2002) 219-318
3. Bondarenko, A., Dung, P.M., Kowalski, R., Toni, F.: An abstract, argumentation-theoretic approach to default reasoning. Artificial Intelligence 93 (1997) 63-101
4. Parsons, S., Sierra, C., Jennings, N.: Agents that reason and negotiate by arguing. Journal of Logic and Computation 8 (1998) 261-292
5. Parsons, S., Wooldrige, M., Amgoud, L.: Properties and complexity of some formal inter-agent dialogues. Journal of Logic and Computation 13 (2003) 348-376
6. Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77 (1995) 321-358
7. th Conference on Uncertainty in Artificial Intelligence. (1993) 114-121
8. Pollock, J.: How to reason defeasibly. Artificial Intelligence 57 (1992) 1-42
9. Simari, G., Loui, R.: A mathematical treatment of defeasible reasoning and its implementation. Artificial Intelligence 53 (1992) 125-157
10. Vreeswijk, G.: Abstract argumentation systems. Artificial Intelligence 90 (1997) 225-279
11. Elvang-Gøransson, M., Fox, J., Krause, P.: Acceptability of arguments as logical uncertainty. In: Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty. (1993) 85-90
12. Elvang-Gøransson, M., Hunter, A.: Argumentative logics: Reasoning with classically inconsistent information. Data and Knowledge Engineering 16 (1995) 125-145
13. Besnard, P., Hunter, A.: A logic-based theory of deductive arguments. Artificial Intelligence 128 (2001) 203-235
14. th Conference on Uncertainty in Artificial Intelligence. (1998) 1-7
15. Amgoud, L., Cayrol, C.: Inferring from inconsistency in preference-based argumentation frameworks. Journal of Automated Reasoning 29 (2002) 125-169
16. Amgoud, L., Cayrol, C.: A reasoning model based on the production of acceptable arguments. Annals of Mathematics and Artificial Intelligence 34 (2002) 197-215
17. rd European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty. Volume 946 of Lecture Notes on Artificial Intelligence. (1995)
18. th International Joint Conference on Artificial Intelligence. (1995)
19. Dimopoulos, Y., Nebel, B., Toni, F.: On the computional complexity of assumption-based argumentation for default reasoning. Artificial Intelligence 141 (2002) 57-78
20. Baroni, P., Giacomin, M., G.Guida: Extending abstract argumentation systems theory. Artificial Intelligence 120 (2000) 251-270
21. th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty. Volume 2711 of Lecture Notes on Artificial Intelligence. (2003) 440-451
22. th International Workshop on Non-Monotonie Reasoning. (2004) 50-58
23. th International Workshop on Non-Monotonie Reasoning. (2002) 408-415
24. th International Conference on Information Processing and Management of Uncertainty in Knowledge-based Systems. (2002) 83-90
25. Dimopoulos, Y., Torres, A.: Graph theoretical structures in logic programs and default theories. Theoretical Computer Science 170 (1996) 209-244
26. Dunne, P., Bench-Capon, T.: Coherence in finite argument system. Artificial Intelligence 141 (2002) 187-203
27. Papadimitriou, C.: Computational complexity. Addison-Wesley (1994)