This paper provides equational semantics for Dung's argumentation networks. The network nodes get numerical values in [0,1], and are supposed to satisfy certain equations. The solutions to these equations correspond to the ?extensions? of the network. This approach is very general and includes the Caminada labelling as a special case, as well as many other so-called network extensions, support systems, higher level attacks, Boolean networks, dependence on time, and much more. The equational approach has its conceptual roots in the nineteenth (...) century following the algebraic equational approach to logic by George Boole, Louis Couturat, and Ernst Schroeder. (shrink)

Governments and other groups interested in the views of citizens require the means to present justifications of proposed actions, and the means to solicit public opinion concerning these justifications. Although Internet technologies provide the means for such dialogues, system designers usually face a choice between allowing unstructured dialogues, through, for example, bulletin boards, or requiring citizens to acquire a knowledge of some argumentation schema or theory, as in, for example, ZENO. Both of these options present usability problems. In this paper, (...) we describe an implemented system called PARMENIDES which allows structured argument over a proposed course of action, without requiring knowledge of the underlying argumentation theory. (shrink)

Continuing his exploration of the organization of complexity and the science of design, this new edition of Herbert Simon's classic work on artificial ...