Gerard Vreeswijk

Learn More
The theory of argumentation is a rich, interdisciplinary area of research straddling the fields of artificial intelligence, philosophy, communication studies, linguistics, and psychology. In the last years, significant progress has been made in understanding the theoretical properties of different argumentation logics. However, one major barrier to the(More)
4 General features of argument-based semantics 15 4.1 The `unique status assignment' approach . . . . . . . . . . . . . . 17 4.1.1 Fixed-point de nitions . . . . . . . . . . . . . . . . . . . . 17 4.1.2 Recursive de nitions . . . . . . . . . . . . . . . . . . . . . 21 4.2 The `multiple status assignment' approach . . . . . . . . . . . . . 25 4.3 Comparing(More)
argumentation systems * Gerard A.W. Vreeswijk a,b** a Department of Computer Science (F&W), University of Limburg, P.0. Box 616, 6200 MD Maastricht, Netherlands h Department of Computer Science, Washington University, Campus Box 1045, One Brook&s Drive, St. Louis, MO 63130-4899, USA Received December 1995; revised September 1996
Computational dialectics is concerned with the formal representation of argument and dispute. The field emerged from developments in philosophy, artificial intelligence and legal theory. Its goal is to suggestalgorithms, procedures and protocols to investigate the tenability of logical claims, on the basis of information in the form of rules and cases.(More)
Argumentation is becoming increasingly important in the design and implementation of autonomous software agents. We believe that agents engaged in decision-making and reasoning should have access to a general purpose argumentation engine that can be configured to conform to one of a range of semantics. In this paper we discuss our current work on a(More)
This paper studies the logical formalisation and implementation of dialogue systems for argumentation, motivated by the claim that this benefits their formal investigation and implementation. A case study is described in which a dialogue system of Prakken is formalised in Shanahan’s version of the ‘full’ Event Calculus and then implemented as a Prolog(More)