Argumentation semantics in extended logic programming has been deened in 3, 10] for a single agent, determining the agents' beliefs by an internal argumentation process. In this paper we extend the argumentation framework to a multi-agent setting including cooperation among agents. We present an algorithm for inference in the framework and an example to show the process of cooperation and argum...

: This study aims to explore the relationship between syntactic and lexical complexity and also the relationship between different aspects of lexical complexity. To this end, speech monologs of 35 Iranian high-intermediate learners of English on three different tasks (i.e. argumentation, description, and narration) were analyzed for correlations between one measure of sy...

An argumentation system can undergo changes (addition or removal of arguments/interactions), particularly in multiagent systems. In this paper, we are interested in dynamics of abstract bipolar argumentation systems, i.e. argumentation systems using two kinds of interaction: attacks and supports. We propose change characterizations that use and extend previous results defined in the case of Dun...

In this paper we take a step towards using Argumentation in Social Networks and introduce Social Abstract Argumentation Frameworks, an extension of Dung’s Abstract Argumentation Frameworks that incorporates social voting. We propose a class of semantics for these new Social Abstract Argumentation Frameworks and prove some important non-trivial properties which are crucial for their applicabilit...

We present a dialectical proof procedure for computing skeptical preferred semantics in argumentation frameworks. The proof procedure is based on the dispute derivation introduced for assumption-based framework. We prove the soundness of the procedure for any argumentation frameworks and the completeness for a general class of finitary argumentation frameworks containing the class of finite arg...

Since their introduction by Dung over a decade ago, abstract argumentation frameworks have received increasing interest in artificial intelligence as a convenient model for reasoning about general characteristics of argument. Such a framework consists of a set of arguments and a binary defeat relation among them. Various semantic and computational approaches have been developed to characterise ...

In argumentation theory, argumentation schemes are abstract argument forms expressed in natural language, commonly used in everyday conversational argumentation. In computational linguistics, discourse analysis have been conducted to identify the discourse structure of connected text, i.e. the nature of the discourse relationships between sentences. In this paper, we propose to couple these two...

This paper combines two recent extensions of Dung’s abstract argumentation frameworks in order to define an abstract formalism for reasoning about preferences in structured argumentation frameworks. First, extended argumentation frameworks extend Dung frameworks with attacks on attacks, thus providing an abstract dialectical semantics that accommodates argumentation-based reasoning about prefer...

The changing of arguments and their attack relation is an intrinsic property of a variety of argumentation systems. So, it is very important to efficiently figure out how the status of arguments in a system evolves when the system is updated. However, unlike other areas of argumentation that have been deeply explored, such as argumentation semantics, proof theories, and algorithms, etc., dynami...

The purpose of this paper is to study the fundamental mechanism humans use in argumentation and its role in different major approaches to commonsense reasoning in AI and logic programming. We present three novel results: We develop a theory for argumentation in which the acceptability of arguments is precisely defined. We show that logic programming and nonmonotonic reasoning in AI are differen...