Argument & Computation (A&C) enters its seventh year, renewed in two respects: • A new access policy with a new publisher: the journal adopts a full open access policy with no fees for authors who submit a paper during coming two years at least. We are indebted to the new publisher IOS Press for its enthusiastic support in enabling and promoting this important transition; • A renewed editorial ...

This paper reports progress in realizing human-agent argumentation, which we argue will be part of future Computer-Supported Collaborative Argumentation (CSCA) tools. With a particular interest in argument mapping, we present two investigations demonstrating how a particular agent-oriented language and architecture can augment CSCA: (i) the use of the IBIS formalism enabling Brahms agents to si...

Rapid growth in the area of argument mining has resulted in an ever increasing volume of analysed argument data. Being able to store information about arguments people make in favour or against different opinions, decisions and actions is a highly valuable resource, yet extremely challenging for sense-making. How, for example, can an analyst quickly check whether in a corpus of citizen dialogue...

This paper presents our efforts to create argument structures from meeting transcripts automatically. We show that unit labels of argument diagrams can be learnt and predicted by a computer with an accuracy of 78,52% and 51,43% on an unbalanced and balanced set respectively. We used a corpus of over 250 argument diagrams that was manually created by applying the Twente Argument Schema. In this ...

In the present paper, a translational model to psychoanalyze the cyberspace is presented with the argument that cyberspace is a translated version of human unconscious that projects both our unfulfilled desires and suppressed anxieties. This Freudian-based line of argument is followed by Lacanian (1950s)and Zizekian (2004) psychoanalysis to problematize the digitalization of Oedipus complex and...

A generalized Sundman transformation dt = crds for exponent n ≥ 1 may be used to accelerate the numerical computation of high-eccentricity orbits, by transforming time t to a new independent variable s. Once transformed, the integration in uniform steps of s effectively gives analytic step variation in t with larger time steps at apogee than at perigee, making errors at each point roughly compa...