In this paper we show how the defense relation among abstract arguments can be used to encode the reasons for accepting arguments. After introducing a novel notion of defenses and defense graphs, we propose a defense semantics together with a new notion of defense equivalence of argument graphs, and compare defense equivalence with standard equivalence and strong equivalence, respectively. Then...

Two transformations between the complex space and 2-dimensional Euclidian topological space are defined. By them, the concept of argument is induced to 2dimensional vectors using argument of complex number. Similarly, the concept of an angle is introduced using the angle of two complex numbers. The concept of a triangle and related concepts are also defined in n-dimensional Euclidian topologica...

Existing approaches to summarizing multi-party argumentative conversations in reader comment are extractive and fail to capture the argumentative nature of these conversations. Work on argument mining proposes schemes for identifying argument elements and relations in text but has not yet addressed how summaries might be generated from a global analysis of a conversation based on these schemes....

This paper fortifies and defends the so called Sufficiency Argument (SA) against Classical Invariantism. In Sect. 2, I explain the version of the SA formulated but then rejected by Brown (2008a). In Sect. 3, I show how cases described by Hawthorne (2004), Brown (2008b), and Lackey (forthcoming) threaten to undermine one or the other of the SA’s least secure premises. In Sect. 4, I buttress one ...

In this note, we define an operator on a space of Itô processes, which call Caputo-Itô derivative, then considerer Cauchy problem for stochastic fractional differential equation with derivative. We demonstrate the existence and uniqueness by contraction mapping argument some examples are given.

Handling the procedure interface in an HPF compiler is complex due to the many possible combinations of Fortran 90/HPF properties of an actual array argument and its associated dummy argument. This paper describes an algorithm that reduces this complexity by mapping all the combinations of properties to a small set of canonical Internal Representations. These internal representations as well as...

We will call such adjuncts instances of the X or no X construction It was suggested in the middle 1980s by Alexis Manaster-Ramer that well-formed instances of X or no X involve a string X of unbounded length preceding or no, with an exact copy following (for a brief allusion to it in print, see Manaster-Ramer 1986). This claim has received hardly any discussion at all in the subsequent literatu...

The top-down approach is based on running the recursive code as is, generating implicitly the recursion structure from the root of the DAG down to the leaves. Each time a solution to a smaller instance is found for the first time it generates a mapping from the input argument to its solution. This way when we come across the same argument a second time we can just look up the solution. This pro...

This paper uses tools from argumentation and artificial intelligence to build a system to analyse reasoning from a motive to an action and reasoning from circumstantial evidence of actions to a motive. The tools include argument mapping, argumentation schemes, inference to the best explanation and a hybrid method of combining argument and explanation. Several examples of use of relevant motive ...

The top-down approach is based on running the recursive code as is, generating implicitly the recursion structure from the root of the DAG down to the leaves. Each time a solution to a smaller instance is found for the first time it generates a mapping from the input argument to its solution. This way when we come across the same argument a second time we can just look up the solution. This pro...