Handling Ignorance in Argumentation: Semantics of Partial Argumentation Frameworks

Authors:
C. Cayrol;C. Devred;M. C. Lagasquie-Schiex
Affiliations:
IRIT, Université Paul Sabatier, Toulouse;CRIL, Université d'Artois, Lens, and LERIA, Université d'Angers,;IRIT, Université Paul Sabatier, Toulouse
Venue:
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Year:
2007

Citing 7
Cited 0

On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Artificial Intelligence
An abstract, argumentation-theoretic approach to default reasoning

Artificial Intelligence
Logical models of argument

ACM Computing Surveys (CSUR)
Coherence in finite argument systems

Artificial Intelligence
Modeling Dialogues Using Argumentation

ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
SCC-recursiveness: a general schema for argumentation semantics

Artificial Intelligence
Symmetric argumentation frameworks

ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we propose semantics for acceptablity in partial argumentation frameworks (PAF). The PAF is an extension of Dung's argumentation framework and has been introduced in [1] for merging argumentation frameworks. It consists in adding a new interaction between arguments representing the ignorance about the existence of an attack.The proposed semantics are built following Dung's method, so that they generalize Dung's semantics without increasing the temporal complexity.