On the existence of semi-stable extensions

Belgian/Netherlands Artificial Intelligence Conference

Volumn , Issue , 2010, Pages

  Caminada, Martin ^a   Verheij, Bart ^b  

^a UNIVERSITY OF LUXEMBOURG   (Luxembourg)

^b UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT ARGUMENTATION; ARGUMENTATION FRAMEWORKS; PREFERRED SEMANTICS; STABLE SEMANTICS;

SEMANTICS;

PROBLEM SOLVING;

EID: 84874003292     PISSN: 15687805     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. 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.
2. 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.
3. 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 (EC-SQARU 2007), number 4724 in Springer Lecture Notes in AI, pages 222-234, Berlin, 2007. Springer Verlag.
4. M.W.A. Caminada. An algorithm for computing semi-stable semantics. Technical Report Technical Report UU-CS-2007-010, Utrecht University, 2007.
5. 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.
6. S. Doutre and J. Mengin. An algorithm that computes the preferred extensions of argumentation frameworks. In ECAI'2000, Third International Workshop on Computational Dialectics (CD'2000), pages 55-62, August 2000.
7. 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.
8. P.E. Dunne. On concise encodings of preferred extensions. In S. Benferhat and E. Giunchiglia, editors, Proc. 9th International Workshop on Non-Monotonic Reasoning (NMR'2002), pages 392-398, Toulouse, France, April 2002.
9. P.E. Dunne and M.W.A. Caminada. Computational complexity of semi-stable semantics in abstract argumentation frameworks. In Steffen Hölldobler, Carsten Lutz, and HeinrichWansing, editors, Logics in Artificial Intelligence, 11th European Conference (JELIA 2008), volume 5293 of Lecture Notes in Computer Science, pages 153-165. Springer, 2008.
10. H. Jakobovits and D. Vermeir. Robust semantics for argumentation frameworks. Journal of logic and computation, 9(2):215-261, 1999.
11. J.L. Pollock. How to reason defeasibly. Artificial Intelligence, 57:1-42, 1992.
12. J.L. Pollock. Cognitive Carpentry. A Blueprint for How to Build a Person. MIT Press, Cambridge, MA, 1995.
13. 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.
14. B. Verheij. DEFLOG - a logic of dialectical justification and defeat. Technical report, Department of Metajuridica, Universiteit Maastricht, 2000.
15. B. Verheij. On the existence and multiplicity of extension in dialectical argumentation. In Salem Benferhat and Enrico Giunchiglia, editors, Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR'2002), pages 416-425, 2002.
16. B. Verheij. DEFLOG: on the logical interpretation of prima facie justified assumptions. Journal of Logic and Computation, 13:319-346, 2003.
17. B. Verheij. A labeling approach to the computation of credulous acceptance in argumentation. In Manuela M. Veloso, editor, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, pages 623-628, 2007.
18. G.A.W. Vreeswijk. An algorithm to compute minimally grounded and admissible defence sets in argument systems. In P.E. Dunne and TJ.M. Bench-Capon, editors, ComputationalModels of Argument; Proceedings of COMMA 2006, pages 109-120. IOS, 2006.