An argument game for stable semantics

Logic Journal of the IGPL

Volumn 17, Issue 1, 2009, Pages 77-90

  Caminada, Martin ^a   Wu, Yining ^a  

^a UNIVERSITY OF LUXEMBOURG   (Luxembourg)

Author keywords

Argument labellings; Argumentation; Discussion games; Stable semantics

Indexed keywords

COMPUTERS; LOGIC PROGRAMMING;

'CURRENT; ARGUMENT LABELLING; ARGUMENTATION; DISCUSSION GAME; PREFERRED SEMANTICS; PROPERTY; STABLE SEMANTICS;

SEMANTICS;

EID: 60349096384     PISSN: 13670751     EISSN: 13689894     Source Type: Journal    
DOI: 10.1093/jigpal/jzn029     Document Type: Article

References (19)

1. P. Baroni and M. Giacomin. On principle-based evaluation of extension-based argumentation semantics. Artificial Intelligence, 171(10-15):675-700, 2007.
2. P. Baroni, M. Giacomin, and G. Guida. Scc-recursiveness: A general schema for argumentation semantics. Artificial Intelligence, 168(1-2):165-210, 2005.
3. L. Bodenstaff, H. Prakken, and G. Vreeswijk. On formalising dialogue systems for argumentation in the event calculus. In Proceedings of the Eleventh International Workshop on Nonmonotonic Reasoning, pages 374-382, Windermere (UK), 2006.
4. M. W. A. Caminada. For the sake of the Argument. Explorations into argument-based reasoning. Doctoral dissertation Free University Amsterdam, 2004.
5. M. W. A. Caminada. On the issue of reinstatement in argumentation. In M. Fischer, W. van der Hoek, B. Konev, and A. Lisitsa, editors, Logics in Artificial Intelligence; 10th European Conference, JELIA 2006, pages 111-123. Springer, 2006. LNAI 4160.
6. M. W. A. Caminada. Semi-stable semantics. In P.E. Dunne and TJ.M. Bench-Capon, editors, Computational Models of Argument; Proceedings of COMMA 2006, pages 121-130. IOS Press, 2006.
7. M. W. A. Caminada. An algorithm for computing semi-stable semantics. In Proceedings of the 9th European Conference on Symbolic and Quantitalive Approaches to Reasoning with Uncertainty (ECSQARU 2007), number 4724 in Springer Lecture Notes in AI, pages 222-234, Berlin, 2007. Springer Verlag.
8. C. Cayrol, S. Doutre, and J. Mengin. On Decision Problems related to the preferred semantics for argumentation frameworks. Journal of Logic and Computation, 13(3):377-403, 2003.
9. Y. Dimopoulos and A. Torres. Graph theoretical structures in logic programs and default theories. Theoretical Computer Science, 170:209-244, 1996.
10. 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.
11. P. M. Dung, P. Mancarella, and F. Toni. Computing ideal sceptical argumentation. Artificial Intelligence, 171(10-15):642-674, 2007.
12. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of the 5th International Conference/ Symposium on Logic Programming, pages 1070-1080. MIT Press, 1988.
13. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9(3/4):365-385, 1991.
14. J. L. Pollock. Cognitive Carpentry. A Blueprint for How to Build a Person. MIT Press, Cambridge, MA, 1995.
15. H. Prakken and G. Sartor. Argument-based extended logic programming with defeasible priorities. Journal of Applied Non-Classical Logics, 7:25-75, 1997.
16. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81-132, 1980.
17. B. Verheij. Two approaches to dialectical argumentation: Admissible sets and argumentation stages. In J.-J.Ch. Meyer and L. C. van der Gaag, editors, Proceedings of the Eighth Dutch Conference on Artificial Intelligence (NAIC'96), pages 357-368, Utrecht, 1996. Utrecht University.
18. J. von Neumann and O. Morgenstern. Theory of Games and Economic Behavior. Princeton University Press, 1944.
19. G. A. W. Vreeswijk and H. Prakken. Credulous and sceptical argument games for preferred semantics. In Proceedings of the 7th European Workshop on Logic for Artificial Intelligence (JELIA-00), number 1919 in Springer Lecture Notes in AI, pages 239-253, Berlin, 2000. Springer Verlag.