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

Farid Nouioua; Vincent Risch

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

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

Topics: Knowledge Representation and Reasoning; Logic Programming

In Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, 237-242, 2012 , Vilamoura, Algarve, Portugal

Authors: Farid Nouioua and Vincent Risch

Affiliation: Aix–Marseille Univ, France

Keyword(s): Abstract argumentation frameworks, Answer-sets, Defaults.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Knowledge Representation and Reasoning ; Logic Programming ; Symbolic Systems

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.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 52.14.130.13

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

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 2: ICAART; ISBN 978-989-8425-95-9; ISSN 2184-433X, SciTePress, pages 237-242. DOI: 10.5220/0003717002370242

@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 2: ICAART},
year={2012},
pages={237-242},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003717002370242},
isbn={978-989-8425-95-9},
issn={2184-433X},
}

TY - CONF

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