In dialogical argumentation, it is often assumed that the involved parties will always correctly identify the intended statements posited by each other and realize all of the associated relations, conform to the three acceptability states (accepted, rejected, undecided), adjust their views whenever new and correct information comes in, and that a framework handling only attack relations is suff...

This position paper describes our work in application frameworks. Some questions for discussion are also stated and we try to answer them based on either our theoretical studies or our previous experience. Our major research topics are also presented as relevant points to be discussed in the workshop.

Methods of argument representation can be exploited in systems for edemocracy. In this paper we discuss a particular method of argument representation, known as an argumentation scheme, and some issues concerning the relations between arguments represented using such schemes. We show how this method of argument representation has been implemented in a practical system designed for the public to...

The aim of this paper is to present a detailed explanation of three models of Shelah. We show the rule of the amalgamation in the construction of models in which all deenable sets of reals have Baire property or are Lebesgue measurable. Next we construct a model in which every projective set of reals has Baire property, a model with the Uniformization Property and a model of ZF + DC in which al...

In this paper, we show that preferences intervene twice in argumentation frameworks: i) to compute standard solutions (i.e. extensions), and ii) to refine those solutions (i.e. to return only the preferred extensions). The two roles are independent and obey to distinct postulates. After introducing and studying the postulates, we provide an example of a formal framework which models the two rol...

In this paper, we model a recent legal case as presented in a court of first instance using argument schemes and an argumentation framework, providing a formal analysis of the case and how the outcome was determined. The paper contributes to the body of literature that formally analyses legal cases in terms of arguments and argument schemes. It is novel in that we analyse a case in a court of f...

Book contents’ browsing and retrieval have been greatly facilitated by i ts Table-of-

A partition u of [k] = f1; 2; : : : ; kg is contained in another partition v of [l] if [l] has a k-subset on which v induces u. We are interested in counting partitions v not containing a given partition u or a given set of partitions R. This concept is related to that of forbidden permutations. A strengthening of Stanley{Wilf conjecture is proposed. We prove that the GF counting v is rational ...