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

Farid Nouioua, Vincent Risch

2012

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.

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