An algorithm for stage semantics

Frontiers in Artificial Intelligence and Applications

Volumn 216, Issue , 2010, Pages 147-158

  Caminada, Martin ^a  

^a UNIVERSITY OF LUXEMBOURG   (Luxembourg)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY;

'CURRENT; ABSTRACT ARGUMENTATION; ARGUMENTATION THEORY; LABELINGS; PROPERTY;

SEMANTICS;

EID: 78049278973     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-60750-619-5-147     Document Type: Conference Paper

References (18)

1. O. Arieli and A. Avron. The value of the four values. Artificial Intelligence, 102:97-141, 1998.
2. P. Baroni, F. Cerutti, M. Giacomin, and G. Guida. Encompassing attacks to attacks in abstract argumentation frameworks. In Proc. of ECSQARU 2009, 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, pages 83-94, 2009.
3. P. Baroni, M. Giacomin, and G. Guida. SCC-recursiveness: a general schema for argumentation semantics. Artificial Intelligence, 168 (1-2): 165-210, 2005.
4. 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.
5. 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.
6. 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.
7. M. W. A. Caminada. A labelling approach for ideal and stage semantics. submitted, 2010.
8. M. W. A. Caminada and D. M. Gabbay. A logical account of formal argumentation. Studia Logica, 93 (2-3): 109-145, 2009. Special issue: new ideas in argumentation theory.
9. W. Carnielli, M. E. Coniglio, and J. Marcos. Logics of formal inconsistency. In D. M. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, second edition, volume 14, pages 15-114. Springer Verlag, 2002.
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. S. Modgil. An abstract theory of argumentation that accommodates defeasible reasoning about preferences. In Proc. ECSQARU 2007, pages 648-659, 2007.
13. S. Modgil. Reasoning about preferences in argumentation frameworks. Artificial Intelligence, 173:901-1040, 2009.
14. S. Modgil and M. W. A. Caminada. Proof theories and algorithms for abstract argumentation frameworks. In I. Rahwan and G. R. Simari, editors, Argumentation in Artificial Intelligence, pages 105-129. Springer, 2009.
15. 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.
16. B. Verheij. DEFLOG - a logic of dialectical justification and defeat. Technical report, Department of Metajuridica, Universiteit Maastricht, 2000.
17. B. Verheij. DEFLOG: on the logical interpretation of prima facie justified assumptions. Journal of Logic and Computation, 13:319-346, 2003.
18. Y. Wu, M. W. A. Caminada, and D. M. Gabbay. Complete extensions in argumentation coincide with 3-valued stable models in logic programming. Studia Logica, 93 (1-2): 383-403, 2009. Special issue: new ideas in argumentation theory.