A RECONSTRUCTION OF ABSTRACT ARGUMENTATION ADMISSIBLE SEMANTICS INTO DEFAULTS AND ANSWER SETS PROGRAMMING

Farid Nouioua, Vincent Risch

Abstract

Given a default theory, we first show that the justified extensions of this theory characterize the maximal conflict-free sets of the corresponding abstract argumentation framework such as defined by Dung. We then show how to specialize justified extensions in order to represent admissible (and hence preferred and stable) extensions inside default theories. Relying on the correspondance of justified extensions with i-answer sets on one hand, on the semi-monotonic character of justified extensions on the other hand, we then show that any admissible (or preferred) set of arguments of the initial argumentation framework can be directly computed from the i-answer sets of the equivalent logic program. Eventually, this allows us to consider the addition of integrity constraints with whom the admissible sets are filtered from each i-answer set.

References

  1. Amgoud, L. and Besnard, P. (2009). Bridging the gap between abstract argumentation systems and logic. In Godo, L. and Pugliese, A., editors, Scalable Uncertainty Management: Proceedings of SUM 2009, volume 5785 of Lecture Notes in Computer Science, pages 12-27. Springer.
  2. Baroni, P., Giacomin, M., and Guida, G. (2005). Sccrecursiveness: a general schema for argumentation semantics. Artificial Intelligence, 168(1-2):162-210.
  3. Besnard, P. and Hunter, A. (2008). Elements of Argumentation. The MIT Press.
  4. Bondarenko, A., Dung, P. M., Kowalski, R. A., and Toni, F. (1997). An abstract, argumentation-theoric approach to default reasoning. Artificial Intelligence, 93(1- 2):63-101.
  5. Caminada, M. (2006). Semi-stable semantics. In Dunne, P. E. and Bench-Capon, T. J. M., editors, COMMA: Computational Models of Argument, volume 144 of Frontiers in Artificial Intelligence and Applications, pages 121-130. IOS Press.
  6. Delgrande, J. P., Gharib, M., Mercer, R. E., Risch, V., and Schaub, T. (2003). Lukaszewicz-style answer set programming: A preliminary report. In Vos, M. D. and Provetti, A., editors, ASP: Second International Workshop on Answer Set Programming. CEUR Workshop Proceedings, Aachen, Germany.
  7. Dung, P. M. (1995). On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence, 77(2):321-358.
  8. Egly, U., Gaggl, S. A., and Woltran, S. (2010). Answerset programming encodings for argumentation frameworks. Argument and Computation, 1(2):147-177.
  9. Gebser, M., Gharib, M., Mercer, R. E., and Schaub, T. (2009). Monotonic answer set programming. Journal of Logic and Computation, 19(4):539-564.
  10. Lukaszewicz, W. (1988). Considerations on default logic - an alternative approach. Computational Intelligence, 4:1-16.
  11. Nieves, J. C., Cortés, U., and Osorio, M. (2008). Preferred extensions as stable models. TPLP, 8(4):527-543.
  12. Reiter, R. (1980). A logic for default reasoning. Artificial Intelligence, 13:81-132.
  13. Risch, V. (1996). Analytic tableaux for default logics. Journal of Applied Non-Classical Logics, 6:71-88.
Download


Paper Citation


in Harvard Style

Nouioua F. and Risch V. (2012). A RECONSTRUCTION OF ABSTRACT ARGUMENTATION ADMISSIBLE SEMANTICS INTO DEFAULTS AND ANSWER SETS PROGRAMMING . In Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8425-95-9, pages 237-242. DOI: 10.5220/0003717002370242


in Bibtex Style

@conference{icaart12,
author={Farid Nouioua and Vincent Risch},
title={A RECONSTRUCTION OF ABSTRACT ARGUMENTATION ADMISSIBLE SEMANTICS INTO DEFAULTS AND ANSWER SETS PROGRAMMING},
booktitle={Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2012},
pages={237-242},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003717002370242},
isbn={978-989-8425-95-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - A RECONSTRUCTION OF ABSTRACT ARGUMENTATION ADMISSIBLE SEMANTICS INTO DEFAULTS AND ANSWER SETS PROGRAMMING
SN - 978-989-8425-95-9
AU - Nouioua F.
AU - Risch V.
PY - 2012
SP - 237
EP - 242
DO - 10.5220/0003717002370242