Related papers: Notes on Abstract Argumentation Theory
In this paper, we present a preliminary work on an approach to fill the gap between logic-based argumentation and the numerous approaches to tackle the dynamics of abstract argumentation frameworks. Our idea is that, even when arguments and…
This volume contains revised versions of the papers selected for the third volume of the Online Handbook of Argumentation for AI (OHAAI). Previously, formal theories of argument and argument interaction have been proposed and studied, and…
The first-order model theory of modules has been studied for decades. More recently, the model theoretic study of nonelementary classes of modules--especially Abstract Elementary Classes of modules--has produced interesting results. This…
The aim of this paper is to announce the release of a novel system for abstract argumentation which is based on decomposition and dynamic programming. We provide first experimental evaluations to show the feasibility of this approach.
These are Notes prepared for nine lectures given at the Mathematical Sciences Research Institute, MSRI, Berkeley during the period January--March 1995. It is a pleasant duty to record here my gratitude to MSRI, and its staff, for making…
This short note is an "elementary'' introduction to the conjectural theory of motives.
We define the syntax and reduction relation of a recursively typed lambda calculus with a parallel case-function (a parallel conditional). The reduction is shown to be confluent. We interpret the recursive types as information systems in a…
In dialogical argumentation it is often assumed that the involved parties always correctly identify the intended statements posited by each other, realize all of the associated relations, conform to the three acceptability states (accepted,…
This is a summary of the proof of BAB conjecture. All material are taken from the two BAB paper in the reference. The aim of this summary is to help reader to understand the more technical side of the proof of BAB.
We prove a stronger version of a termination theorem appeared in the paper "On existence of log minimal models II". We essentially just get rid of the redundant assumptions so the proof is almost the same as in there. However, we give a…
Attribute exploration has been investigated in several studies, with particular emphasis on the algorithmic aspects of this knowledge acquisition method. In its basic version the method itself is rather simple and transparent. But when…
The paper is devoted to a generalized and improved version of author's approach to Gromov bounded cohomology theory. In particular, the awkward countability assumption is removed and the aspects related to homological algebra are clarified.…
In this article, we present a novel approach for parsing argumentation structures. We identify argument components using sequence labeling at the token level and apply a new joint model for detecting argumentation structures. The proposed…
Formalizing syntactic proofs of properties of logics, programming languages, security protocols, and other formal systems is a significant challenge, in large part because of the obligation to handle name-binding correctly. We present an…
In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalizing, in this logic, two principles that we call non-contradictory…
We study, in an abstract axiomatic setting, the notion of sectional category of a morphism. From this, we unify and generalize known results about this invariant in different settings as well as we deduce new applications.
We develop a unified categorical theory of substructural abstract syntax with variable binding and single-variable (capture-avoiding) substitution. This is done for the gamut of context structural rules given by exchange (linear theory)…
This paper studies a fundamental mechanism of how to detect a conflict between arguments given sentiments regarding acceptability of the arguments. We introduce a concept of the inverse problem of the abstract argumentation to tackle the…
This paper combines two studies: a topological semantics for epistemic notions and abstract argumentation theory. In our combined setting, we use a topological semantics to represent the structure of an agent's collection of evidence, and…
While the utility of well-chosen abstractions for understanding and predicting the behaviour of complex systems is well appreciated, precisely what an abstraction $\textit{is}$ has so far has largely eluded mathematical formalization. In…