Related papers: Bipolar Weighted Argumentation Graphs
Gradual semantics with abstract argumentation provide each argument with a score reflecting its acceptability, i.e. how "much" it is attacked by other arguments. Many different gradual semantics have been proposed in the literature, each…
The concept of graph powers has been extensively studied in graph theory. Analogous to graph powers, Chandran et al. [3] introduced the notion of bipartite powers for bipartite graphs. In this paper, we show that the class of interval…
We study the topology of real polynomial maps $\mathbb{R}^{4n} \longrightarrow \mathbb{R}^{4}$ expressed in terms of bicomplex variables and their conjugates, which we refer to as bicomplex mixed polynomials. We introduce the notion of…
We propose a concrete surface representation of abstract categorial grammars in the category of word cobordisms or cowordisms for short, which are certain bipartite graphs decorated with words in a given alphabet, generalizing linear logic…
The class of Parikh word representable graphs were recently introduced. In this work, we further develop its general theory beyond the binary alphabet. Our main result shows that this class is equivalent to the class of bipartite…
The connections in many networks are not merely binary entities, either present or not, but have associated weights that record their strengths relative to one another. Recent studies of networks have, by and large, steered clear of such…
This paper is devoted to present two counterexamples to the theorem from \cite{MK} Maria R., Katherine T. M., Bernardo S. M., Extremal graphs with bounded vertex bipartiteness number, Linear Algebra Appl. 493 (2016) 28-36. Moreover, the…
Dung's abstract argumentation framework consists of a set of interacting arguments and a series of semantics for evaluating them. Those semantics partition the powerset of the set of arguments into two classes: extensions and…
In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…
In this work we present a computation paradigm based on a concurrent and incremental construction of proof nets (de-sequentialized or graphical proofs) of the pure multiplicative and additive fragment of Linear Logic, a resources conscious…
We enumerate weighted graphs with a certain upper bound condition. We also compute the generating function of the numbers of these graphs, and prove that it is a rational function. In particular, we show that if the given graph is a…
We propose a new approach to text semantic analysis and general corpus analysis using, as termed in this article, a "bi-gram graph" representation of a corpus. The different attributes derived from graph theory are measured and analyzed as…
In formal argumentation, a distinction can be made between extension-based semantics, where sets of arguments are either (jointly) accepted or not, and ranking-based semantics, where grades of acceptability are assigned to arguments.…
We propose a graph-based process calculus for modeling and reasoning about wireless networks with local broadcasts. Graphs are used at syntactical level to describe the topological structures of networks. This calculus is equipped with a…
Value-based argumentation enhances a classical abstract argumentation graph - in which arguments are modelled as nodes connected by directed arrows called attacks - with labels on arguments, called values, and an ordering on values, called…
We augment Assumption Based Argumentation (ABA for short) with weighted argumentation. In a nutshell, we assign weights to arguments and then derive the weight of attacks between ABA arguments. We illustrate our proposal through running…
A fuzzy multipreference semantics has been recently proposed for weighted conditional knowledge bases, and used to develop a logical semantics for Multilayer Perceptrons, by regarding a deep neural network (after training) as a weighted…
This paper develops a new approach to computational argumentation that is informed by philosophical and linguistic views. Namely, it takes into account two ideas that have received little attention in the literature on computational…
Assumption-based Argumentation (ABA) is a well-known structured argumentation formalism, whereby arguments and attacks between them are drawn from rules, defeasible assumptions and their contraries. A common restriction imposed on ABA…
This note is on the structures of line graphs and 2-variegated graphs. We have given here solutions of some graph equations involving line graphs and 2-variegated graphs.