This paper presents a computational model for the understanding of arguments in natural language dialogues. Previous work on argumentation in Artificial Intelligence has been mainly focused on the conceptual aspects. But argumentation is also a linguistic phenomenon. Language provides structures to express arguments, to orient the argumentative interpretation of utterances, or to present a new ...

In this paper, we define the concept of probabilistic like Menger (probabilistic like quasi Menger) space (briefly, PLM-space (PLqM-space)). We present some coupled fixed point and fixed point results for certain contraction type maps in partially order PLM-spaces (PLqM- spaces).

This paper presents an agent-based argumentation framework. Different from probabilistic, fuzzy and weighted approaches, this framework considers the strength of arguments and attacks from two aspects: the inner structure of arguments and the beliefs of agents. A key concept in this framework is the notion of satisfiability degree, which is used to define the intrinsic strength of attacks and t...

The problems that arise from the presence of self-attacking arguments and odd-length cycles of attack within argumentation frameworks are widely recognized in the literature on defeasible argumentation. This paper introduces two simple semantics to capture different intuitions about what kinds of arguments should become justified in such scenarios. These semantics are modeled upon two extension...

Our concern in this paper is with the question of how irrational an intentional agent can be, and, in particular, with an argument Stephen Stich has given for the claim that there are only very minimal a priori requirements on the rationality of intentional agents. The argument appears in chapter 2 of The Fragmentation of Reason. 1 Stich is concerned there with the prospects for the 'reform-min...

We present a structural analysis method for the recognition of on-line handwritten mathematical expressions based on a minimum spanning tree construction and symbol dominance. The method handles some layout irregularities frequently found in on-line handwritten formula recognition systems, like symbol overlapping and association of arguments of sum-like operators. It also handles arguments of o...