Add Journal to My Library
Journal of Logic and Computation
, Volume 28 (2) – Mar 1, 2018

31 pages

/lp/ou_press/formulating-semantics-of-probabilistic-argumentation-by-characterizing-E7qC2cAbwZ

- Publisher
- Oxford University Press
- Copyright
- © The Author, 2017. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com
- ISSN
- 0955-792X
- eISSN
- 1465-363X
- D.O.I.
- 10.1093/logcom/exx035
- Publisher site
- See Article on Publisher Site

Abstract The existing approaches to formulate the semantics of probabilistic argumentation are based on the notion of possible world. Given a probabilistic argument graph (PrAG) with $$n$$ nodes, up to $$2^n$$ subgraphs are blindly constructed and their extensions under a given semantics are computed. Then, the probability of a set of arguments $$E$$ being an extension under a given semantics $$\sigma$$ (denoted as $$p(E^\sigma)$$) is equal to the sum of the probabilities of all subgraphs each of which has the extension $$E$$. Since many irrelevant subgraphs are constructed, and in many cases, computing extensions of subgraphs is computationally intractable, these approaches are fundamentally inefficient or infeasible. In existing literature, while approximate approaches based on the Monte Carlo simulation technique have been proposed to estimate the probability of extensions, how to improve the efficiency of computation without using the simulation technique is still an open problem. In this article, we address this problem from the following two perspectives. First, conceptually, we define specific properties to characterize the subgraphs of a PrAG with respect to a given extension, such that the probability of a set of arguments $$E$$ being an extension can be defined in terms of these properties, without (or with less) construction of subgraphs. Second, computationally, we take preferred semantics as an example, and develop algorithms to evaluate the efficiency of our approach. The results show that our approach not only dramatically decreases the time for computing $$p(E^\sigma)$$, but also has an attractive property, which is contrary to that of existing approaches: the denser the edges of a PrAG are or the bigger the size of a given extension $$E$$ is, the more efficient our approach computes $$p(E^\sigma)$$. Meanwhile, it is shown that under complete and preferred semantics, the problems of determining $$p(E^\sigma)$$ are fixed-parameter tractable. 1 Introduction In the past two decades, argumentation has been a very active research area in the field of knowledge representation and reasoning, as a non-monotonic formalism to handle inconsistent and incomplete information by means of constructing, comparing and evaluating arguments. In 1995, Dung proposed a notion of abstract argumentation framework [7], which can be viewed as a directed graph (called argument graph, or defeat graph) $$G = (A, R)$$, in which $$A$$ is a set of arguments and $$R\subseteq A\times A$$ is a set of attacks. Given an argument graph, specific evaluation criteria are defined to determine which arguments can be regarded as justified or acceptable. A set of arguments acceptable together is often called an extension, and the evaluation criteria or sets of extensions of an argument graph are called argumentation semantics. Dung’s abstract argumentation framework and argumentation semantics lay a concrete foundation for the development of various argument systems. However, in classical argumentation theory, the uncertainty of arguments and/or attacks is not considered. So, it could be regarded as a purely qualitative formalism. But, in the real world, arguments and/or attacks are often uncertain. So, in recent years, the importance of combining argumentation and uncertainty has been well recognized, and probability-based argumentation is gaining momentum [8, 10, 24, 26, 33]. In a probabilistic argument graph (or PrAG in brief), each argument is assigned with a probability, denoting the likelihood of the argument appearing in the graph.1 Similar to classical argumentation theory, given a PrAG, a basic problem is to define the status of arguments. The existing approaches are based on the notion of possible worlds [8, 22, 26, 33]. Given a PrAG with $$n$$ nodes, up to $$2^n$$ subgraphs are blindly constructed. Each subgraph corresponds to a possible world where some arguments appear while other arguments do not appear. The extensions of each subgraph are computed according to classical argumentation semantics. Then, the probability of a set of arguments $$E$$ being an extension under a given semantics $$\sigma$$ (denoted as $$p(E^\sigma)$$) is equal to the sum of the probabilities of all subgraphs each of which has the extension $$E$$. Since many irrelevant subgraphs are constructed, and in many cases, computing extensions of subgraphs is computationally intractable, these approaches are fundamentally inefficient or infeasible. In existing literature, while approximate approaches based on the Monte Carlo simulation technique have been proposed to estimate the probability of extensions [18, 26], how to improve the efficiency of computation without using simulation technique is still an open problem. Since the complexity of computing $$p(E^\sigma)$$ by the existing approaches is mainly caused by blindly constructing subgraphs and computing extensions of each subgraph, an intuitive question arises: Intuitive question Is it possible to compute $$p(E^\sigma)$$ without (or with less) construction and computation of subgraphs? This question has been partially answered by Fazzinga et al. [16]. When analysing the complexity of probabilistic abstract argumentation, they provided a lemma to prove that under admissible and stable semantics, the problem of computing $$p(E^\sigma)$$ is tractable. In this lemma, $$p(E^\sigma)$$ is determined by evaluating an expression which only involves the probabilities of the arguments and defeats (attacks) of a probabilistic argument graph.2 So, in these cases, no subgraphs are constructed and computed. However, under other semantics (including complete, grounded, preferred and ideal), they only stated that the problem of computing $$p(E^\sigma)$$ is $$FP^{\sharp P}$$-complete, without further work on how the above idea can be exploited to improve the efficiency of computation under these semantics. Motivated by the intuitive question and the state of the art of computation of probabilistic argumentation, the research problems of the present paper are as follows. Research problem 1 Under various argumentation semantics (including not only admissible and stable, but also complete, grounded and preferred, etc.), how to define properties to characterize the subgraphs of a PrAG with respect to an extension $$E$$, such that $$p(E^\sigma)$$ can be computed by using these properties, rather than by blindly constructing and computing all subgraphs of the PrAG? Research problem 2 How to evaluate the efficiency of the new approach? With these two research problems in mind, the rest of this article is organized as follows. In Section 2, some notions of abstract argumentation and probabilistic abstract argumentation are reviewed to make this article self-contained. In Sections 3 and 4, to address the first research problem, we define properties to characterize subgraphs (with respect to an extension) under different semantics (admissible, complete, grounded, preferred, and stable), and specify how the probability of a conflict-free set $$E$$ being an extension can be computed by using these properties. In Section 5, to address the second research problem, algorithms are developed to evaluate the performance of the new approach (with a comparison to an existing possible worlds based approach). In Section 6, some computational properties of the new approach are briefly discussed. In Section 7, some existing work closely related to this article is introduced and discussed. Finally, in Section 8, we conclude the article and point out some future work. This article is a substantial extension of the article introduced in [29]. The extension mainly consists of the following aspects: We reformulate the approach of characterizing subgraphs of a PrAG with respect to a given extension, with a more detailed analysis of the properties used to characterize subgraphs; further study the semantics of probabilistic argumentation by directly using properties for characterizing subgraphs; develop algorithms to evaluate the efficiency of the new approach; and analyse the computational properties of the new approach from the perspective parameterized complexity theory. 2 Preliminaries 2.1 Classical abstract argumentation The notions of (classical) abstract argumentation were originally introduced in [7] and then extended by many researchers (please refer to [1] for an excellent introduction), including abstract argumentation framework (called argument graph, or classical argument graph, in this article), extension-based semantics and labelling-based semantics. An argument graph is a directed graph $$G = (A,R)$$, in which $$A$$ is a set of nodes representing arguments and $$R$$ is a set of edges representing attacks between the arguments. Definition 1 An argument graph is a tuple $$G = (A,R)$$, where $$A$$ is a set of nodes representing arguments, and $$R\subseteq A\times A$$ is a set of edges representing attacks. As usual, we say that $$\alpha\in A$$ attacks $$\beta\in A$$ if and only if $$(\alpha, \beta)\in R$$. If $$E\subseteq A$$ and $$\alpha\in A$$ then we say that $$\alpha$$ attacks $$E$$ if and only if there exists $$\beta\in E$$ such that $$\alpha$$ attacks $$\beta$$, that $$E$$ attacks $$\alpha$$ if and only if there exists $$\beta\in E$$ such that $$\beta$$ attacks $$\alpha$$, and that $$E$$ attacks $$E^\prime$$ if and only if there exist $$\beta\in E$$ and $$\alpha\in E^\prime$$ such that $$\beta$$ attacks $$\alpha$$. Given $$G = (A,R)$$, for $$\alpha\in A$$ we write $$\alpha^-_G$$ for $$ \{\beta\mid (\beta, \alpha)\in R\}$$; for $$E\subseteq A$$ we write $$E^-_G$$ for $$ \{\beta\mid \exists \alpha\in E: (\beta, \alpha)\in R\}$$ and $$E^+_G$$ for $$ \{\beta\mid \exists \alpha\in E: (\alpha, \beta)\in R\}$$. Formally, we have the following formulas. \begin{eqnarray} \alpha^-_G&=& \{\beta\mid (\beta, \alpha)\in R\}\\ \end{eqnarray} (1) \begin{eqnarray} E^-_G&=& \{\beta\mid \exists \alpha\in E: (\beta, \alpha)\in R\}\\ \end{eqnarray} (2) \begin{eqnarray} E^+_G&=& \{\beta\mid \exists \alpha\in E: (\alpha, \beta)\in R\}. \end{eqnarray} (3) If without confusion, we write $$\alpha^-$$, $$E^-$$ and $$E^+$$ for $$\alpha^-_G$$, $$E^-_G$$ and $$E^+_G$$ respectively. Given an argument graph, according to certain evaluation criteria, sets of arguments (called extensions) are identified as acceptable together. Two important notions for the definitions of various kinds of extensions are conflict-freeness and acceptability of arguments. Definition 2 Let $$G=( A,R)$$ be an argument graph, and $$E\subseteq A$$ be a set of arguments. $$E$$ is conflict-free if and only if $$\nexists \alpha, \beta\in E$$, such that $$(\alpha,\beta)\in R$$. An argument $$\alpha\in A$$ is acceptable with respect to (defended by) $$E$$, if and only if $$\forall(\beta,\alpha)\in R$$, $$\exists\gamma\in E$$, such that $$(\gamma,\beta)\in R$$. Based on the above two notions, several classes of (classical) extensions can be defined as follows. Definition 3 Let $$G=( A,R)$$ be an argument graph, and $$E\subseteq A$$ a set of arguments. $$E$$ is admissible if and only if $$E$$ is conflict-free, and each argument in $$E$$ is acceptable with respect to $$E$$. $$E$$ is preferred if and only if $$E$$ is a maximal (with respect to set-inclusion) admissible set. $$E$$ is complete if and only if $$E$$ is admissible, and each argument that is acceptable with respect to $$E$$ is in $$E$$. $$E$$ is grounded if and only if $$E$$ is the minimal (with respect to set-inclusion) complete extension. $$E$$ is stable if and only if $$E$$ is conflict-free, and each argument in $$A\setminus E$$ is attacked by $$E$$. In this article, for convenience, we use $$\sigma\in\{ad$$, $$co$$, $$pr$$, $$gr$$, $$st\}$$ to represent a semantics (admissible, complete, preferred, grounded or stable). An extension under semantics $$\sigma$$ is called a $$\sigma$$-extension. The set of $$\sigma$$-extensions of $$G$$ is denoted as $$\mathcal{E}_\sigma(G)$$. In $$G=(A,R)$$, if $$A=R=\emptyset$$, then $$\mathcal{E}_\sigma(G) = \{\emptyset\}$$. Example 1 Let $$G_1 = (A_1, R_1)$$ be an argument graph illustrated as follows. According to Definition 3, $$G_1$$ has four admissible sets: $$\emptyset$$, $$\{a\}$$, $$\{b\}$$ and $$\{a,c\}$$, in which $$\emptyset$$, $$\{b\}$$ and $$\{a,c\}$$ are complete extensions, $$\{b\}$$ and $$\{a,c\}$$ are preferred extensions, $$\{a,c\}$$ is the only stable extension, $$\emptyset$$ is the unique grounded extension. Corresponding to the extension-based approach introduced above, the labelling-based approach is another way to formulate argumentation semantics. Since we will use labelling-based approach to develop algorithms in Section 5.1, some basic notions of this approach are briefly introduced here. The idea underlying the labelling-based approach is to give each argument a label, which is defined in advance. In existing literature, the set of labels is usually defined as: $$\mathrm{IN}$$, $$\mathrm{OUT}$$ and $$\mathrm{UNDEC}$$. The label $$\mathrm{IN}$$ indicates that the argument is explicitly accepted, the label $$\mathrm{OUT}$$ indicates that the argument is explicitly rejected, and the label $$\mathrm{UNDEC}$$ indicates that the status of the argument is undecided, meaning that one abstains from an opinion on whether the argument is accepted or rejected. Meanwhile, there could be some other choices for the set of labels. For instance, in [25], a four-valued labelling is considered. In this article, we choose the three-valued-labelling, which can be formally defined as follows. Definition 4 (Labelling) Given an argument graph $$G=( A,R)$$ and three labels $$\mathrm{IN}$$, $$\mathrm{OUT}$$ and $$\mathrm{UNDEC}$$, a labelling is a total function: \begin{eqnarray} \mathcal{L}: A\mapsto \{\mathrm{IN}, \mathrm{OUT}, \mathrm{UNDEC}\}. \end{eqnarray} (4) Let $$in(\mathcal{L}) = \{\alpha\mid \mathcal{L}(\alpha) = \mathrm{IN}\}$$, $$out(\mathcal{L}) = \{\alpha\mid \mathcal{L}(\alpha) = \mathrm{OUT}\}$$, and $$undec(\mathcal{L}) = \{\alpha\mid \mathcal{L}(\alpha) = \mathrm{UNDEC}\}$$. A labelling $$\mathcal{L}$$ is often represented as a triple of the form $$(in(\mathcal{L}) , out(\mathcal{L}) , undec(\mathcal{L}) )$$. One of criteria for labelling-based semantics is whether a label assigned to an argument is legal. According to Definition 4, given a labelling $$\mathcal{L}$$, the status assigned to each argument might not be legal. We say that assigning $$\mathrm{IN}$$ to an argument is legal if and only if all its attackers have been assigned $$\mathrm{OUT}$$; assigning $$\mathrm{OUT}$$ to an argument is legal if and only if one of its attackers has been assigned $$\mathrm{IN}$$; and assigning $$\mathrm{UNDEC}$$ to an argument is legal if and only if not all its attacks are labelled $$\mathrm{OUT}$$ and it does not have an attacker that is labelled $$\mathrm{IN}$$. Formally, we have the following definition. Definition 5 (Legal labelling) Let $$\mathcal{L}$$ be a labelling of an argument graph $$G=( A,R)$$ and $$\alpha\in A$$. $$\alpha$$ is legally $$\mathrm{IN}$$ if and only if $$\mathcal{L}(\alpha) = $$$$\mathrm{IN}$$ and for all $$\beta\in A$$, if $$(\beta, \alpha)\in R$$, then $$\mathcal{L}(\beta) =$$$$\mathrm{OUT}$$. $$\alpha$$ is legally $$\mathrm{OUT}$$ if and only if $$\mathcal{L}(\alpha) = $$$$\mathrm{OUT}$$ and there exists $$\beta\in A$$, such that $$(\beta, \alpha)\in R$$, and $$\mathcal{L}(\beta) =$$$$\mathrm{IN}$$. $$\alpha$$ is legally $$\mathrm{UNDEC}$$ if and only if $$\mathcal{L}(\alpha) = $$$$\mathrm{UNDEC}$$ and (1) there exists $$\beta\in A$$, such that $$(\beta, \alpha)\in R$$, and $$\mathcal{L}(\beta) \neq$$$$\mathrm{OUT}$$, and (2) for all $$\beta\in A$$, if $$(\beta, \alpha)\in R$$, then $$\mathcal{L}(\beta) \neq$$$$\mathrm{IN}$$. According to the notion of legal labelling, the notion of illegal labelling can be defined as follows. Definition 6 (Illegal labelling) Let $$\mathcal{L}$$ be a labelling of an argument graph $$G=( A,R)$$ and $$\alpha\in A$$. $$\alpha$$ is illegally $$\mathrm{IN}$$ if and only if $$\mathcal{L}(\alpha) = $$$$\mathrm{IN}$$, but $$\alpha$$ is not legally $$\mathrm{IN}$$. $$\alpha$$ is illegally $$\mathrm{OUT}$$ if and only if $$\mathcal{L}(\alpha) = $$$$\mathrm{OUT}$$, but $$\alpha$$ is not legally $$\mathrm{OUT}$$. $$\alpha$$ is illegally $$\mathrm{UNDEC}$$ if and only if $$\mathcal{L}(\alpha) = $$$$\mathrm{UNDEC}$$, but $$\alpha$$ is not legally $$\mathrm{UNDEC}$$. Based on the notions of legal labelling, labelling-based semantics can be defined as follows. Definition 7 (Labelling-Based Semantics) Let $$\mathcal{L}$$ be a labelling of an argument graph $$G=( A,R)$$. $$\mathcal{L}$$ is an admissible labelling, if and only if each argument that is labelled $$\mathrm{IN}$$ is legally $$\mathrm{IN}$$, and each argument that is labelled $$\mathrm{OUT}$$ is legally $$\mathrm{OUT}$$. $$\mathcal{L}$$ is a complete labelling, if and only if it is an admissible labelling, and each argument that is labelled $$\mathrm{UNDEC}$$ is legally $$\mathrm{UNDEC}$$. $$\mathcal{L}$$ is a grounded labelling, if and only if it is a complete labelling, and $$in(\mathcal{L})$$ is minimal (with respect to set inclusion). $$\mathcal{L}$$ is a preferred labelling, if and only if it is a complete labelling, and $$in(\mathcal{L})$$ is maximal (with respect to set inclusion). $$\mathcal{L}$$ is a stable labelling, if and only if it is a complete labelling, and $$undec(\mathcal{L}) =\emptyset$$. Based on the above notions, Modgil and Caminada developed algorithms (called MC algorithms) [31] to compute the preferred labellings and the grounded labelling of an argument graph.3 The MC algorithm for computing preferred labellings is realized by computing admissible labellings that maximize the number of arguments that are legally IN. Here, admissible labellings are generated by starting with a labelling that labels all arguments IN and then iteratively, selects arguments that are illegally IN (or super-illegally IN) and applies a transition step to obtain a new labelling, until a labelling is reached in which no argument is illegally IN. In this algorithm, the notions of super-illegally IN and transition step are introduced as follows. For more details about the MC algorithms, please refer to [31]. First, since all arguments are initially labelled IN, some of which might be illegal. To get an admissible labelling which might be a preferred labelling, it is necessary to change the label of each argument that is illegally IN, preferably without creating any arguments that are illegally OUT. The notion of a transition step is used for this purpose. In other words, a transition step basically takes an argument that is illegally IN and relabels it to OUT. It then checks if, as a result of this, one or more arguments have become illegally OUT. If this is the case, then these arguments are relabelled to UNDEC. Formally, the notion of transition step is defined as follows [31]. Definition 8 (Transition step) Let $$\mathcal{L}$$ be a labelling for $$G=(A,R)$$ and $$\alpha$$ be an argument that is illegally IN in $$\mathcal{L}$$. A transition step on $$\alpha$$ in $$\mathcal{L}$$ consists of the following: the label of $$\alpha$$ is changed from IN to OUT; for every $$\beta\in\{\alpha\}\cup\{\gamma\mid (\alpha,\gamma)\in R\}$$, if $$\beta$$ is illegally OUT, then the label of $$\beta$$ is changed from OUT to UNDEC. Second, if we select arbitrarily the arguments that are illegally IN to do transition steps, then we might obtain some admissible labellings that are not complete labellings (and therefore not preferred labellings). To improve the efficiency of computation, in the MC algorithm for preferred labellings, they proposed a notion, called super-illegally IN. It is said that an argument $$\alpha$$ in $$\mathcal{L}$$ that is illegally IN, is also super-illegally IN if and only if it is attacked by an argument $$\beta$$ that is legally IN in $$\mathcal{L}$$, or UNDEC in $$\mathcal{L}$$. This notion can be used to guide the choice of arguments on which to perform transition steps, such that the non-complete labellings can be avoided. 2.2 Probabilistic abstract argumentation The notions of probabilistic abstract argumentation are defined by combining the notions of classical abstract argumentation and those of probabilistic theory, including probabilistic argument graph and its semantics. According to [22], we have the following definition. Definition 9 A probabilistic argument graph (or PrAG for short) is a triple $$G^p = (A,R, p)$$ where $$G =(A,R)$$ is an argument graph and $$p: A\rightarrow [0,1]$$ is a probability function assigning to every argument $$\alpha\in A$$ a probability $$p(\alpha)$$ that $$\alpha$$ appears (and hence a probability $$1-p(\alpha)$$ that $$\alpha$$ does not appear). In existing literature, the semantics of a PrAG is defined according to the notion of possible world. Given a PrAG, a possible world represents a scenario consisting of some subset of the arguments and attacks in the graph. So, given a PrAG with $$n$$ nodes, there are up to $$2^n$$ subgraphs with nonzero probability. A subgraph induced by a set $$A^\prime\subseteq A$$ is represented as $$G^\prime= (A^\prime, R^\prime)$$, in which $$R^\prime = R\cap (A^\prime\times A^\prime)$$. For convenience, we also use $$G_{\downarrow A^\prime}$$ to denote a subgraph $$G^\prime = (A^\prime, R^\prime)$$. Under a semantics $$\sigma\in \{ad, co, pr, gr, st\}$$, the extensions of each subgraph are computed according to the definition of classical argumentation semantics. Then, the probability that a set of arguments $$E\subseteq A$$ is a $$\sigma$$-extension, denoted as $$p(E^\sigma)$$, is the sum of the probability of each subgraph for which $$E$$ is a $$\sigma$$-extension. In calculating the probability of each subgraph, we assume independence of arguments appearing in a graph. A discussion about the assumption of independence of arguments is presented in Section 7.1. For simplicity, let us abuse the notation, using $$p(\bar{\alpha})$$ to denote $$1- p(\alpha)$$. Then, the probability of subgraph $$G^\prime$$, denoted $$p(G^\prime)$$, can be defined as follows. \begin{eqnarray} p(G^\prime) &=& (\Pi_{\alpha\in A^\prime}\, p(\alpha))\times (\Pi_{\alpha\in A\setminus A^\prime}\, p(\bar{\alpha})). \label{formula-subgr} \end{eqnarray} (5) Given a PrAG $$G^p = (A,R, p)$$, let $$Q_\sigma(E)$$ denote the set of subgraphs of $$G$$, each of which has an extension $$E$$ under a given semantics $$\sigma\in\{ad, co$$, $$pr, gr$$, $$st\}$$. Based on formula (5), $$p(E^\sigma)$$ is defined as follows [22]. \begin{eqnarray} p(E^\sigma) &=& \Sigma_{G^\prime\in Q_\sigma(E)}\,p(G^\prime). \label{formula-2} \end{eqnarray} (6) Example 2 Let $$G_1^p = (A_1, R_1, p)$$ be a PrAG (illustrated as follows), where $$p(a) = 0.5$$, $$p(b) = 0.8$$, $$p(c) = 0.4$$ and $$p(d) = 0.5$$. The subgraphs of $$G_1^p$$ are presented in Table 1. Table 1. Subgraphs of $$G_1$$ Subgraphs Probability of subgraph Preferred extensions $$G^1_1$$ 0.08 $$\{b\}, \{a, c\}$$ $$G^2_1$$ $$a\leftrightarrow b\rightarrow c$$ 0.08 $$\vphantom{0^{0^{0^0}}}\{b\}, \{a,c\}$$ $$G^3_1$$ 0.12 $$\{a\}, \{b\}$$ $$G^4_1$$ $$a\leftrightarrow b$$ 0.12 $$\{a\},\{b\}$$ $$G^5_1$$ 0.02 $$\{a,c\}$$ $$G^6_1$$ $$a \hspace{0.45cm}c$$ 0.02 $$\{a,c\}$$ $$G^7_1$$ 0.03 $$\{a\}$$ $$G^8_1$$ a 0.03 $$\{a\}$$ $$G^9_1$$ 0.08 $$\{b\}$$ $$G^{10}_1$$ $$b\rightarrow c$$ 0.08 $$\{b\}$$ $$G^{11}_1$$ 0.12 $$\{b\}$$ $$G^{12}_1$$ $$b$$ 0.12 $$\{b\}$$ $$G^{13}_1$$ 0.02 $$\{c\}$$ $$G^{14}_1$$ $$c$$ 0.02 $$\{c\}$$ $$G^{15}_1$$ 0.03 $$\{\}$$ $$G^{16}_1$$ 0.03 $$\{ \}$$ Subgraphs Probability of subgraph Preferred extensions $$G^1_1$$ 0.08 $$\{b\}, \{a, c\}$$ $$G^2_1$$ $$a\leftrightarrow b\rightarrow c$$ 0.08 $$\vphantom{0^{0^{0^0}}}\{b\}, \{a,c\}$$ $$G^3_1$$ 0.12 $$\{a\}, \{b\}$$ $$G^4_1$$ $$a\leftrightarrow b$$ 0.12 $$\{a\},\{b\}$$ $$G^5_1$$ 0.02 $$\{a,c\}$$ $$G^6_1$$ $$a \hspace{0.45cm}c$$ 0.02 $$\{a,c\}$$ $$G^7_1$$ 0.03 $$\{a\}$$ $$G^8_1$$ a 0.03 $$\{a\}$$ $$G^9_1$$ 0.08 $$\{b\}$$ $$G^{10}_1$$ $$b\rightarrow c$$ 0.08 $$\{b\}$$ $$G^{11}_1$$ 0.12 $$\{b\}$$ $$G^{12}_1$$ $$b$$ 0.12 $$\{b\}$$ $$G^{13}_1$$ 0.02 $$\{c\}$$ $$G^{14}_1$$ $$c$$ 0.02 $$\{c\}$$ $$G^{15}_1$$ 0.03 $$\{\}$$ $$G^{16}_1$$ 0.03 $$\{ \}$$ According to formula (6), there are 5 preferred extensions with non-zero probability: \begin{eqnarray*} p(\emptyset^{pr}) &=&p(G^{15}_{1})+p(G^{16}_{1})= 0.06 \\ p(\{a\}^{pr}) &=& p(G^3_1)+p(G^4_1)+p(G^7_1)+p(G^8_1)=0.3 \\ p(\{b\}^{pr}) &=&p(G^1_1)+p(G^2_1)+p(G^3_1)+p(G^4_1) + p(G^9_1)+p(G^{10}_1)\\ &&+p(G^{11}_1)+p(G^{12}_1)=0.8 \\ p(\{c\}^{pr}) &=& p(G^{13}_1)+p(G^{14}_1)=0.04 \\ p(\{a, c\}^{pr}) &=&p(G^1_1)+p(G^2_1)+p(G^5_1)+p(G^6_1)= 0.2. \end{eqnarray*} This example shows that by using the existing possible worlds based approach, to obtain the probability that a set $$E$$ of arguments is an extension under a given semantics (i.e. $$p(E^\sigma)$$), one has to compute the extensions of all subgraphs under this semantics, although some of these subgraphs have no extension $$E$$. Since many irrelevant subgraphs are constructed and computed, and in many cases, computing extensions of subgraphs is computationally intractable, this possible worlds based approach is fundamentally inefficient or infeasible. In [18], Fazzinga et al. proposed a new approach and proved that under admissible and stable semantics, the problem of determining $$p(E^\sigma)$$ is tractable. However, under complete, grounded and preferred semantics, the problem of determining $$p(E^\sigma)$$ is $$FP^{\sharp P}$$-complete. This calls for developing more efficient approaches, including the approximate approaches introduced in [26] and [18]. 3 Characterized subgraphs with respect to an extension Given a PrAG, since the probability of a set of arguments $$E$$ being an extension under a given semantics $$\sigma$$ (i.e. $$p(E^\sigma)$$) is equal to the sum of the probabilities of the subgraphs each of which has an extension $$E$$, the main issue is to identify the subgraphs. As mentioned in Section 1, unlike the existing approaches, we define general properties to characterize the subgraphs, such that $$p(E^\sigma)$$ can be computed by using these properties, rather than by blindly constructing and computing all subgraphs of the PrAG. To begin with, let us introduce a notion of $$\sigma$$-subgraph with respect to an extension: If a subgraph has a $$\sigma$$-extension $$E$$, then it is called a $$\sigma$$-subgraph with respect to $$E$$. Formally, we have the following definition. Definition 10 Let $$G^p = (A,R, p)$$ be a PrAG, $$G = (A,R)$$ be the corresponding classical argument graph, $$G_{\downarrow A^\prime}$$ be a subgraph of $$G$$ where $$A^\prime\subseteq A$$, and $$E\subseteq A$$ be a set of arguments. We say that $$G_{\downarrow A^\prime}$$ is a $$\sigma$$-subgraph of $$G$$ with respect to $$E$$, if and only if $$G_{\downarrow A^\prime}$$ has a $$\sigma$$-extension $$E$$, where $$\sigma\in\{ad, co, pr, gr, st\}$$. Example 3 Consider $$G_1^p$$ in Example 2. Given $$E_1 = \{a\}$$, $$G_1^3, G_1^4, G_1^7$$ and $$G_1^8$$ are preferred subgraphs of $$G_1^p$$ with respect to $$E_1$$. Then, given a PrAG $$G^p = (A,R, p)$$, a set of arguments $$E\subseteq A$$ and a semantics $$\sigma\in\{ad, co, pr, gr, st\}$$, a function (called subgraph identification function) is used to map $$E$$ to a set of $$\sigma$$-subgraphs of $$G$$ with respect to $$E$$. Definition 11 Let $$G^p = (A,R, p)$$ be a PrAG, and $$G = (A,R)$$ be the corresponding argument graph. Let $$\mathbb{G} = \{G_{\downarrow A^\prime} \mid A^\prime \in 2^A\}$$ be the set of all subgraphs of $$G$$. A subgraph identification function under a given semantics $$\sigma\in\{ad, co, pr, gr, st\}$$ (denoted as $$\rho^\sigma$$) is defined as a mapping: \begin{equation} \rho^\sigma: 2^A \rightarrow 2^{\mathbb{G}} \end{equation} (7) such that given $$E\in 2^A$$, for all $$G^\prime\in \rho^\sigma(E)$$, $$G^\prime$$ is a $$\sigma$$-subgraph of $$G$$ with respect to $$E$$. In Definition 11, $$\rho^\sigma$$ ($$\sigma\in\{ad, co, pr, gr, st\}$$) can be understood as a class of functions (i.e. $$\rho^{ad}$$, $$\rho^{co}$$, $$\rho^{pr}$$, $$\rho^{gr}$$ and $$\rho^{st}$$), each of which is a function under a given semantics. These subgraph identification functions can be instantiated in different ways. A simple but inefficient way is to construct the set of all subgraphs of $$G$$ (i.e. $$\mathbb{G}$$) and then for each subgraph to verify whether it has an extension $$E$$. In terms of this approach, subgraphs are constructed blindly, although many of them are irrelevant. And, for each subgraph, the algorithm to verify $$E$$ being an extension of the subgraph might be intractable (e.g. under preferred semantics, the problem of verifying whether $$E$$ is an extension is coNP-complete [11]). To cope with this problem, we introduce as follows another way to instantiate the subgraph identification functions. In this new approach, properties related to $$E$$ are used to characterize the set of subgraphs each of which has an extension $$E$$. Since $$p(E^\sigma)$$ may be computed by using these properties (please refer to Section 4 for details), the characterized subgraphs can be kept (completely or partially) implicit, rather than explicitly constructed and computed (although the subgraphs may be also explicitly represented according to the properties, as presented in formulas (8)–(12)). Since when $$E$$ is not conflict-free, the set of characterized subgraphs with respect to $$E$$ is an empty set, for simplicity, when talking about the set of characterized subgraphs with respect to a set of arguments $$E$$, we only consider the cases where $$E$$ is conflict-free. Under different semantics, properties used to characterize subgraphs may vary. However, they are all based on the following components related to $$E$$ (as illustrated in Figure 1):4 (1) $$E$$; (2) $$E_G^-\setminus E_G^+$$: the set of arguments each of which attacks $$E$$ but is not attacked by $$E$$; (3) $$E_G^+$$: the set of arguments each of which is attacked by $$E$$; (4) $$I = A\setminus (E\cup E_G^+\cup E_G^-)$$: the set of arguments each of which is not in $$E$$, $$E_G^+$$ or $$E_G^-$$. We call $$I$$ the set of remaining arguments (of $$G$$ with respect to $$E$$) that indirectly affects $$E$$ being a $$\sigma$$-extension. Figure 1. View largeDownload slide Four components of $$G$$ w.r.t. $$E$$. It holds that $$E\cup (E_G^-\setminus E_G^+) \cup E_G^+\cup I = A$$. Figure 1. View largeDownload slide Four components of $$G$$ w.r.t. $$E$$. It holds that $$E\cup (E_G^-\setminus E_G^+) \cup E_G^+\cup I = A$$. First, under admissible semantics, each admissible subgraph can be characterized by the following two properties (as illustrated in Figure 2): Prop1: All arguments in $$E$$ appear in the subgraphs; and Prop2: All arguments in $$E_G^-\setminus E_G^+$$ do not appear in the subgraph (while the appearance of arguments in any subset of $$I \cup E_G^+$$ does not affect $$E$$ being an extension of the subgraph). Figure 2. View largeDownload slide Given a PrAG $$G = (A, R, p)$$, a subgraph $$G^\prime$$ is an admissible subgraph w.r.t. $$E$$ if and only if arguments in $$E$$ appear, arguments in $$E_G^-\setminus E_G^+$$ do not appear, while arguments in any subset of $$I \cup E_G^+$$ may apear in the subgraph. Figure 2. View largeDownload slide Given a PrAG $$G = (A, R, p)$$, a subgraph $$G^\prime$$ is an admissible subgraph w.r.t. $$E$$ if and only if arguments in $$E$$ appear, arguments in $$E_G^-\setminus E_G^+$$ do not appear, while arguments in any subset of $$I \cup E_G^+$$ may apear in the subgraph. Prop2 means that every argument in $$E$$ is acceptable with respect to $$E$$. Given that $$E$$ is conflict-free and every argument in $$E$$ is acceptable with respect to $$E$$, $$E$$ is an admissible extension. So, by definition, the subgraph is an admissible subgraph. According to the above analysis, we have the following proposition. Proposition 1 Let $$G^p = (A,R, p)$$ be a PrAG, $$G=(A, R)$$ be a corresponding argument graph, and $$E\subseteq A$$ be a conflict-free set of arguments. Then, for all $$B\in 2^{I\cup E_G^+}$$, $$G_{\downarrow E\cup B}$$ is an admissible subgraph of $$G$$ with respect to $$E$$. Proof. We need to verify that $$E$$ is an admissible set of $$G_{\downarrow E\cup B}$$. Since $$E$$ is conflict-free, we only need to prove that $$\forall \alpha \in E$$, $$\alpha$$ is acceptable with respect to $$E$$. Since $$E$$ is conflict-free and there is no interaction between $$I$$ and $$E$$, it holds that $$\alpha$$ is not attacked by the arguments in $$E\cup (I\cap B)$$. And, $$\forall\beta\in E_G^+\cap B$$, no matter whether $$\beta$$ attacks $$\alpha$$, by the definition of $$E_G^+$$, $$\beta$$ is attacked by $$E$$. In summary, $$\forall \beta \in E\cup (I\cap B)\cup (E_G^+\cap B) = E\cup B$$, $$\beta$$ either does not attack $$\alpha$$ or is attacked by $$E$$. So, $$\forall \alpha \in E$$, $$\alpha$$ is acceptable with respect to $$E$$. ■ According to Proposition 1, the set of admissible subgraphs $$\rho^{ad}(E)$$ can be specified as follows: \begin{equation} \label{for-admiss} \rho^{ad}(E) = \{G_{\downarrow E\cup B} \mid B\in 2^{I\cup E_G^+}\}. \end{equation} (8) Example 4 Consider $$G_1^p$$ in Example 2 again. According to formula (8), there are eight admissible subgraphs with respect to $$\{a\}$$: $$G^1_1$$, $$G^2_1$$, $$\dots$$, $$G^8_1$$ (as shown in the third column of Table 2), i.e., $$\rho^{ad}(\{a\}) = \{G^1_1, G^2_1, \dots, G^8_1\}$$. Table 2. $$\sigma$$-subgraphs of $$G_1$$ with respect to $$\{a\}$$ Subgraph Admissible subgraph w.r.t. $$\{a\}$$ Comple subgraph w.r.t. $$\{a\}$$ Stable subgraph w.r.t. $$\{a\}$$ Preferred subgraph w.r.t. $$\{a\}$$ Grounded subgraph w.r.t. $$\{a\}$$ $$G^1_1$$ Yes Yes No No No $$G^2_1$$ $$a\leftrightarrow b\rightarrow c$$ Yes No No No No $$G^3_1$$ Yes Yes No Yes No $$G^4_1$$ $$a\leftrightarrow b$$ Yes Yes Yes Yes No $$G^5_1$$ Yes Yes No No Yes $$G^6_1$$ $$a \hspace{0.45cm}c$$ Yes No No No No $$G^7_1$$ Yes Yes No Yes Yes $$G^8_1$$ a Yes Yes Yes Yes Yes $$G^9_1$$ No No No No No $$G^{10}_1$$ $$b\rightarrow c$$ No No No No No $$G^{11}_1$$ No No No No No $$G^{12}_1$$ $$b$$ No No No No No $$G^{13}_1$$ No No No No No $$G^{14}_1$$ $$c$$ No No No No No $$G^{15}_1$$ No No No No No $$G^{16}_1$$ No No No No No Subgraph Admissible subgraph w.r.t. $$\{a\}$$ Comple subgraph w.r.t. $$\{a\}$$ Stable subgraph w.r.t. $$\{a\}$$ Preferred subgraph w.r.t. $$\{a\}$$ Grounded subgraph w.r.t. $$\{a\}$$ $$G^1_1$$ Yes Yes No No No $$G^2_1$$ $$a\leftrightarrow b\rightarrow c$$ Yes No No No No $$G^3_1$$ Yes Yes No Yes No $$G^4_1$$ $$a\leftrightarrow b$$ Yes Yes Yes Yes No $$G^5_1$$ Yes Yes No No Yes $$G^6_1$$ $$a \hspace{0.45cm}c$$ Yes No No No No $$G^7_1$$ Yes Yes No Yes Yes $$G^8_1$$ a Yes Yes Yes Yes Yes $$G^9_1$$ No No No No No $$G^{10}_1$$ $$b\rightarrow c$$ No No No No No $$G^{11}_1$$ No No No No No $$G^{12}_1$$ $$b$$ No No No No No $$G^{13}_1$$ No No No No No $$G^{14}_1$$ $$c$$ No No No No No $$G^{15}_1$$ No No No No No $$G^{16}_1$$ No No No No No Secondly, under stable semantics, each stable subgraph can be characterized by the following two properties (as illustrated in Figure 3): Prop1: All arguments in $$E$$ appear in the subgraph. Prop3: All arguments in $$A\setminus (E\cup E_G^+) = I \cup (E_G^-\setminus E_G^+)$$ do not appear in the subgraph. Figure 3. View largeDownload slide Given a PrAG $$G = (A, R, p)$$, a subgraph $$G^\prime$$ is a stable subgraph w.r.t. $$E$$ if and only if arguments in $$E$$ appear, arguments in $$I \cup (E_G^-\setminus E_G^+)$$ do not appear, while arguments in any subset of $$E_G^-$$ may appear. Figure 3. View largeDownload slide Given a PrAG $$G = (A, R, p)$$, a subgraph $$G^\prime$$ is a stable subgraph w.r.t. $$E$$ if and only if arguments in $$E$$ appear, arguments in $$I \cup (E_G^-\setminus E_G^+)$$ do not appear, while arguments in any subset of $$E_G^-$$ may appear. Prop3 means that for each argument $$\alpha$$ in $$A\setminus E$$, if it appears in the subgraph, then it is attacked by $$E$$ (i.e. $$\alpha\in E_G^+$$). Given that $$E$$ is conflict-free and for every argument that is not in $$E$$ it is attacked by $$E$$, $$E$$ is a stable extension. So, by definition, the subgraph is a stable subgraph. Formally, we have the following proposition. Proposition 2 Let $$G^p = (A,R, p)$$ be a PrAG, $$G=(A, R)$$ be a corresponding argument graph, and $$E\subseteq A$$ be a conflict-free set of arguments. Then, for all $$B\in 2^{E_G^+}$$, $$G_{\downarrow E\cup B}$$ is a stable subgraph of $$G$$ with respect to $$E$$. Proof. Since $$E$$ is conflict-free, to prove $$E$$ being a stable extension of $$G_{\downarrow E\cup B}$$, we only need to verify that $$\forall \alpha\in (E\cup B)\setminus E = B$$, $$\alpha$$ is attacked by $$E$$. Since $$\alpha\in B \subseteq E_G^+$$, by the definition of $$E_G^+$$, $$\alpha$$ is attacked by $$E$$. ■ According to Proposition 2, the set of stable subgraphs $$\rho^{st}(E)$$ can be specified as follows: \begin{equation} \label{for-stable} \rho^{st}(E) = \{G_{\downarrow E\cup B} \mid B\in 2^{E_G^+}\}. \end{equation} (9) Thirdly, under other semantics (complete, grounded and preferred), the set of remaining arguments $$I = A\setminus (E\cup E_G^+\cup E_G^-)$$ plays a very important role in characterizing $$\sigma$$-subgraphs. Let $$G_{\downarrow E\cup B}$$ (where $$B\in 2^{I\cup E_G^+}$$) be an admissible subgraph of $$G$$ with respect to $$E$$, and $$B^\prime = B\cap I$$. Whether $$G_{\downarrow E\cup B}$$ is a complete subgraph with respect to $$E$$ is determined by a property of the arguments in $$B^\prime\in 2^I$$. Intuitively, if the following property holds, then $$G_{\downarrow E\cup B}$$ is a complete subgraph with respect to $$E$$ (as illustrated in Figure 4): Prop4: For all $$\alpha\in B^\prime$$, $$\alpha$$ is attacked by $$B^\prime$$. Figure 4. View largeDownload slide Given a PrAG $$G = (A, R, p)$$, a subgraph $$G^\prime$$ is a complete subgraph w.r.t. $$E$$ if and only if it is an admissible subgraph w.r.t. $$E$$, and each argument in $$B^\prime$$ is attacked by some arguments in $$B^\prime$$. Figure 4. View largeDownload slide Given a PrAG $$G = (A, R, p)$$, a subgraph $$G^\prime$$ is a complete subgraph w.r.t. $$E$$ if and only if it is an admissible subgraph w.r.t. $$E$$, and each argument in $$B^\prime$$ is attacked by some arguments in $$B^\prime$$. This property means that for every remaining argument $$\alpha\in B^\prime$$, $$\alpha$$ is not acceptable with respect to $$E$$. Based on this property, we have the following proposition. Proposition 3 Let $$G^p = (A,R, p)$$ be a PrAG, $$G=(A, R)$$ be a corresponding argument graph, $$E\subseteq A$$ be a conflict-free set of arguments. For all $$B\in 2^{I\cup E_G^+}$$, $$G_{\downarrow E\cup B}$$ is a complete subgraph of $$G$$ with respect to $$E$$, if and only if $$\forall \alpha\in B^\prime$$, $$\alpha_{G}^- \cap B^\prime\neq \emptyset$$. Proof. Since $$B\in 2^{I\cup E_G^+}$$, according to Proposition 1, $$G_{\downarrow E\cup B}$$ is an admissible subgraph. ($$\Rightarrow$$:) When $$G_{\downarrow E\cup B}$$ is a complete subgraph of $$G$$ with respect to $$E$$, assume that $$\exists \alpha\in B^\prime$$ such that $$\alpha_G^- \cap B^\prime= \emptyset$$. It follows that $$\alpha$$ is acceptable with respect to $$E$$, and therefore $$E$$ is not a complete extension, contradicting $$G_{\downarrow E\cup B}$$ is a complete subgraph with respect to $$E$$. ($$\Leftarrow$$:) For all $$\alpha\in B^\prime$$, for all $$\beta\in \alpha_{G}^-\cap B^\prime$$, $$\beta$$ cannot be attacked by the arguments in $$E$$. Otherwise, $$\beta$$ is in $$E_G^+$$, contradicting $$\beta \in B^\prime \subseteq I$$ and $$I \cap E_G^+ = \emptyset$$. Since $$\alpha_{G}^-\cap B^\prime \neq \emptyset$$, $$\alpha$$ is not acceptable with respect to $$E$$. Since $$E$$ is an admissible set, $$E$$ is a complete extension. According to Definition 10, $$G_{\downarrow E\cup B}$$ is a complete subgraph of $$G$$ with respect to $$E$$. ■ According to Proposition 3, the set of complete subgraphs $$\rho^{co}(E)$$ can be specified as follows: \begin{equation} \label{formula-compl} \rho^{co}(E) = \{G_{\downarrow E\cup B} \mid (B\in 2^{I\cup E_G^+})\wedge(\forall \alpha\in B^\prime: \alpha_{G}^-\cap B^\prime\neq\emptyset)\}. \end{equation} (10) Example 5 Among the eight admissible subgraphs, except $$G_1^2$$ and $$G_1^6$$, others are complete subgraphs with respect to $$\{a\}$$ (as shown in the fourth column of Table 2), i.e., $$\rho^{co}(\{a\}) = \{G^1_1, G^3_1,G^4_1, G^5_1, G^7_1, G^8_1\}$$. With regard to $${G_1^2}$$, $$B^\prime = \{c\}$$. Since $$c_{G_1}^- = \emptyset$$, $$G_1^2$$ is not a complete subgraph with respect to $$\{a\}$$. Similarly, $$G_1^6$$ is not a complete subgraph with respect to $$\{a\}$$. Then, under preferred semantics, given a complete subgraph $$G_{\downarrow E\cup B}$$ (where $$B\in 2^{I\cup E_G^+}$$), whether $$G_{\downarrow E\cup B}$$ is a preferred subgraph is determined by a property of the subgraph induced by $$B^\prime\in 2^I$$. More specifically, if the following property holds, then $$G_{\downarrow E\cup B}$$ is a preferred subgraph: Prop5: $$G_{\downarrow B^\prime}$$ has only an empty admissible extension. Proposition 4 Let $$G^p = (A,R, p)$$ be a PrAG, and $$E\subseteq A$$ be a conflict-free set of arguments. Then, for all $$B\in 2^{I\cup E_G^+}$$, $$G_{\downarrow E\cup B}$$ is a preferred subgraph of $$G$$ with respect to $$E$$ if and only if $$G_{\downarrow E\cup B}$$ is a complete subgraph of $$G$$ with respect to $$E$$, and $$\mathcal{E}_{ad}(G_{\downarrow B^\prime}) = \{\emptyset\}$$. Proof. $$(\Rightarrow)$$: Assume the contrary, i.e., $$G_{\downarrow B^\prime}$$ has a non-empty admissible extension $$E^\prime\subseteq B^\prime$$. It follows that $$E\cup E^\prime$$ is admissible, in that: $$E\cup E^\prime$$ is conflict-free: both $$E$$ and $$E^\prime$$ are conflict-free; $$E$$ does not attack $$E^\prime$$ (otherwise, $$E^\prime\cap E_G^+\neq \emptyset$$, contradicting $$E^\prime\subseteq B^\prime$$); $$E^\prime$$ does not attack $$E$$ (otherwise, $$E$$ attacks $$E^\prime$$, contradiction). $$\forall \alpha \in E^\prime$$, $$\alpha$$ is acceptable with respect to $$E\cup E^\prime$$. So, $$E\cup E^\prime$$ is an admissible extension of $$G_{\downarrow E\cup B}$$. So, $$E$$ is not a preferred extension of $$G_{\downarrow E\cup B}$$, contradicting “$$G_{\downarrow E\cup B}$$ is a preferred subgraph of $$G$$ with respect to $$E$$”. $$(\Leftarrow)$$: Since $$G_{\downarrow B^\prime}$$ has only one empty admissible extension, no argument in $$B^\prime$$ is acceptable with respect to $$E$$ or any conflict-free superset of $$E$$. It turns out that $$E$$ is a preferred extension of $$G_{\downarrow E\cup B}$$, i.e., $$G_{\downarrow E\cup B}$$ is a preferred subgraph of $$G$$ with respect to $$E$$. ■ According to Proposition 4, the set of preferred subgraphs $$\rho^{pr}(E)$$ can be specified as follows: \begin{equation} \label{formalus-prf} \rho^{pr}(E) = \{G_{\downarrow E\cup B}\in \rho^{co}(E) \mid \mathcal{E}_{ad}(G_{\downarrow B^\prime})= \{\emptyset\}\}. \end{equation} (11) Example 6 Continue Example 5. Among the six complete subgraphs, except $$G_1^1$$ and $$G_1^5$$, others are preferred subgraphs with respect to $$\{a\}$$ (as shown in the sixth column of Table 2). With regard to $${G_1^1}$$, $$B^\prime = \{c,d\}$$. Then, $$ \mathcal{E}_{ad}(G_{\downarrow B^\prime})= \{\{c\}\} \neq \{\emptyset\}$$. So, $$G_1^1$$ is not a preferred subgraph with respect to $$\{a\}$$. Similarly, $$G_1^5$$ is not a preferred subgraph with respect to $$\{a\}$$. Finally, given a complete subgraph $$G_{\downarrow E\cup B}$$, let $$B^{\prime\prime} = B\cap E_G^+$$. To verify whether it is a grounded subgraph, we may simply check whether $$G_{\downarrow E\cup B^{\prime\prime}}$$ has a grounded extension $$E$$. To simplify the computation, we may divide $$B^{\prime\prime}$$ in to two disjoint subsets $$B^{\prime\prime}_1$$ and $$B^{\prime\prime}_2$$, where $$B^{\prime\prime}_1 = B\cap (E_G^+\setminus E_G^-)$$ and $$B^{\prime\prime}_2 = B\cap (E_G^+\cap E_G^-)$$, as illustrated in Figure 5. Note that arguments in $$E_G^+\setminus E_G^-$$ do not affect the the status of arguments in $$E$$. So, if the following property holds, then $$G_{\downarrow E\cup B}$$ is a grounded subgraph: Prop6: $$G_{\downarrow E\cup B^{\prime\prime} _2}$$ has a grounded extension $$E$$. Figure 5. View largeDownload slide Given a PrAG $$G = (A, R, p)$$, a subgraph $$G^\prime$$ is a grounded subgraph w.r.t. $$E$$ if and only if it is a complete subgraph w.r.t. $$E$$, and $$G_{\downarrow E\cup B^{\prime\prime} _2}$$ has a grounded extension $$E$$. Figure 5. View largeDownload slide Given a PrAG $$G = (A, R, p)$$, a subgraph $$G^\prime$$ is a grounded subgraph w.r.t. $$E$$ if and only if it is a complete subgraph w.r.t. $$E$$, and $$G_{\downarrow E\cup B^{\prime\prime} _2}$$ has a grounded extension $$E$$. Proposition 5 Let $$G^p = (A,R, p)$$ be a PrAG, $$E\subseteq A$$ be a conflict-free set of arguments. For all $$B\in 2^{I\cup E_G^+}$$, $$G_{\downarrow E\cup B}$$ is a grounded subgraph of $$G$$ with respect to $$E$$ if and only if $$G_{\downarrow E\cup B}$$ is a complete subgraph of $$G$$ with respect to $$E$$, and $$E$$ is a grounded extension of $$G_{\downarrow E\cup B^{\prime\prime} _2}$$. Proof. $$(\Rightarrow)$$: Since $$G_{\downarrow E\cup B}$$ is a grounded subgraph of $$G$$ with respect to $$E$$, it holds that $$E$$ is the grounded extension of $$G_{\downarrow E\cup B}$$. First, since a grounded extension is also a complete extension, $$E$$ is a complete extension of $$G_{\downarrow E\cup B}$$, i.e., $$G_{\downarrow E\cup B}$$ is a complete subgraph of $$G$$ with respect to $$E$$. Second, given that $$E$$ is the grounded extension of $$G_{\downarrow E\cup B}$$, since $$E$$ does not receive any attacks from $$B^\prime$$ and $$B_1^{\prime\prime}$$, according to the directionality of grounded semantics [2], it holds that $$E$$ is the grounded extension of $$G_{\downarrow E\cup B^{\prime\prime} _2}$$, where $$B^{\prime\prime} _2 = B\setminus (B^\prime\cup B_1^{\prime\prime})$$. $$(\Leftarrow)$$: Since $$G_{\downarrow E\cup B}$$ is a complete subgraph of $$G$$ with respect to $$E$$, it holds that $$E$$ is a complete extension of $$G_{\downarrow E\cup B}$$. Now, we need to verify that $$E$$ is a minimal complete extension of $$G_{\downarrow E\cup B}$$. Assume the contrary. There exists $$E^\prime \subset E$$ such that $$E^\prime$$ is a grounded extension of $$G_{\downarrow E\cup B}$$. According to the previous proof, it turns out that $$E^\prime$$ is a grounded extension of $$G_{\downarrow E\cup B^{\prime\prime} _2}$$, contradicting $$E$$ is a grounded extension of $$G_{\downarrow E\cup B^{\prime\prime} _2}$$. ■ According to Proposition 5, the set of grounded subgraphs $$\rho^{gr}(E)$$ can be specified as follows: \begin{equation} \label{formalus-gr} \rho^{gr}(E) = \{G_{\downarrow E\cup B}\in \rho^{co}(E) \mid \mathcal{E}_{gr}(G_{\downarrow E\cup B^{\prime\prime} _2})= \{E\}\}. \end{equation} (12) Example 7 Continue Example 5. Among the six complete subgraphs, $$G_1^5$$ and $$G_1^7$$ and $$G_1^8$$ are grounded subgraphs with respect to $$\{a\}$$ (as shown in the last column of Table 2). 4 Semantics of probabilistic argumentation According to the theory introduced in the previous section, given a PrAG $$G^p = (A,R, p)$$, a conflict-free set of arguments $$E\subseteq A$$ and a semantics $$\sigma\in\{ad, co, pr, gr, st\}$$, a set of $$\sigma$$-subgraphs with respect to $$E$$ can be specified in terms of different properties related to $$E$$. Given Prop1 - Prop6 and formulas (8)–(12), we may define semantics of probabilistic argumentation by the following two approaches. In the first place, according to formulas (8)–(12) and (6), semantics of probabilistic argumentation, i.e., the probability of $$E$$ being a $$\sigma$$-extension (denoted as $$p(E^\sigma)$$), can be directly represented as follows. \begin{eqnarray} p(E^\sigma) &=& \Sigma_{G^\prime\in \rho^{\sigma}(E)}\,p(G^\prime). \label{formula-ns} \end{eqnarray} (13) Note that $$Q_\sigma(E)$$ in formula (6) is replaced by $$\rho^{\sigma}(E)$$ in formula (13). In this approach, although the characterized subgraphs are explicitly represented, they are not constructed blindly, but defined according to specific properties. Therefore, the construction of most irrelevant subgraphs is avoided. Meanwhile, under admissible, complete and stable semantics, no computation of extensions is needed, while under preferred and grounded semantics, only the extension of the subgraphs induced by $$B^\prime$$ (resp. $$E\cup B^{\prime\prime}$$) is needed. Note that the number (resp. the average size) of the subgraphs induced by $$B^\prime$$ (resp. $$E\cup B^{\prime\prime}$$) is usually much smaller than that of the subgraphs induced by $$A^\prime\in 2^A$$. In the second place, a more efficient approach to define semantics of probabilistic argumentation is through directly using properties for characterizing subgraphs, such that the characterized subgraphs can be kept implicit as much as possible. Now, let us introduce this approach under different semantics. First, under admissible semantics, according to Prop1 and Prop2, we have the following proposition. Proposition 6 Let $$G^p = (A,R, p)$$ be a PrAG, and $$E\subseteq A$$ be a conflict-free set of arguments. It holds that: \begin{eqnarray} p(E^{ad}) &=& \Pi_{\alpha\in E}p(\alpha)\times\Pi_{\beta\in E_G^-\setminus E_G^+}p(\bar{\beta}). \label{formula-n-11c} \nonumber \end{eqnarray} Proof. According to formulas (8) and (13), $$p(E^{ad}) = \Sigma_{G^\prime\in \rho^{ad}(E)}\,p(G^\prime) = \Sigma_{B\in 2^{I\cup E_G^+}}\,p(G_{\downarrow E\cup B})$$. Since in $$G_{\downarrow E\cup B}$$, every argument in $$E$$ appears, every argument in $$E_G^-\setminus E_G^+$$ does not appear, every argument in $$B$$ appears, and and every argument in $$(I\cup E_G^+)\setminus B$$ does not appear, it holds that $$p(G_{\downarrow E\cup B})= \Pi_{\alpha\in E}p(\alpha)\times \Pi_{\beta\in E_G^-\setminus E_G^+}p(\bar{\beta})\times \Pi_{\gamma\in B}p(\gamma)\times \Pi_{\eta\in (I\cup E_G^+)\setminus B}p(\bar{\eta})$$. Since $$ \Sigma_{B\in 2^{I\cup E_G^+}} (\Pi_{\gamma\in B}p(\gamma)\times \Pi_{\eta\in ({I\cup E_G^+})\setminus B}p(\bar{\eta})) =1$$, we may conclude that: \begin{eqnarray*} p(E^{ad}) &=& \Sigma_{B\in 2^{I\cup E_G^+}}\,p(G_{\downarrow E\cup B})\\ &=& \Sigma_{B\in 2^{I\cup E_G^+}} (\Pi_{\alpha\in E}p(\alpha)\times \Pi_{\beta\in E_G^-\setminus E_G^+}p(\bar{\beta})\times\Pi_{\gamma\in B}p(\gamma)\times \Pi_{\eta\in ({I\cup E_G^+})\setminus B}p(\bar{\eta}))\\ &=& (\Pi_{\alpha\in E}p(\alpha)\times \Pi_{\beta\in E_G^-\setminus E_G^+}p(\bar{\beta})) \times \Sigma_{B\in 2^{I\cup E_G^+}} (\Pi_{\gamma\in B}p(\gamma)\times \Pi_{\eta\in ({I\cup E_G^+})\setminus B}p(\bar{\eta})) \\ &=& \Pi_{\alpha\in E}p(\alpha)\times \Pi_{\beta\in E_G^-\setminus E_G^+}p(\bar{\beta})\times 1 \\ &=& \Pi_{\alpha\in E}p(\alpha)\times \Pi_{\beta\in E_G^-\setminus E_G^+}p(\bar{\beta}). \end{eqnarray*} ■ Second, under stable semantics, according to Prop1 and Prop3, we have the following proposition. Proposition 7 Let $$G^p = (A,R, p)$$ be a PrAG, and $$E\subseteq A$$ be a conflict-free set of arguments. It holds that: \begin{eqnarray} p(E^{st}) &=& \Pi_{\alpha\in E}p(\alpha)\times\Pi_{\beta\in I\cup (E_G^-\setminus E_G^+)}p(\bar{\beta}). \label{formula-n-11a} \nonumber \end{eqnarray} The proof of Proposition 7 is similar to that of Proposition 6, so it is omitted. Third, under complete semantics, according to Prop1, Prop2 and Prop4, we have the following proposition. Proposition 8 Let $$G^p = (A,R, p)$$ be a PrAG, and $$E\subseteq A$$ be a conflict-free set of arguments. It holds that: \begin{eqnarray}\label{formula-n-11b} p(E^{co}) &=& P_E \times P_{I\_CO}, \mbox{where} \nonumber\\ P_E &=& \Pi_{\alpha\in E}p(\alpha)\times\Pi_{\beta\in E_G^-\setminus E_G^+}p(\bar{\beta}), \mbox{and} \nonumber \\ P_{I\_CO} &=& \Sigma_{B^\prime\in 2^I\wedge (\forall \alpha\in B^\prime: \alpha_{G}^-\cap B^\prime\neq\emptyset)} (\Pi_{\gamma\in B^\prime}p(\gamma)\times \Pi_{\xi\in I\setminus B^\prime}p(\bar{\xi})). \nonumber \end{eqnarray} Proof. According to formulas (10) and (13), $$p(E^{co}) = \Sigma_{G^\prime\in \rho^{co}(E)}\,p(G^\prime) = \Sigma_{(B\in 2^{I\cup E_G^+})\wedge (\forall \alpha\in B^\prime: \alpha_{G}^-\cap B^\prime\neq\emptyset)}\,p(G_{\downarrow E\cup B})$$. Let $$B^\prime = B\cap I$$ and $$B^{\prime\prime} = B\cap E_G^+$$. It holds that $$B = B^\prime\cup B^{\prime\prime} $$ and $$B^\prime\cap B^{\prime\prime} = \emptyset$$. Since in $$G_{\downarrow E\cup B^\prime \cup B^{\prime\prime}}$$, every argument in $$E$$ appears, every argument in $$E_G^-\setminus E_G^+$$ does not appear, every argument in $$B^{\prime}$$ (resp. $$B^{\prime\prime}$$) appears, and every argument in $$I\setminus B^{\prime}$$ (resp. $$E_G^+\setminus B^{\prime\prime}$$) does not appear, it holds that $$G_{\downarrow E\cup B} = G_{\downarrow E\cup B^\prime \cup B^{\prime\prime}} = (\Pi_{\alpha\in E}p(\alpha)\times \Pi_{\beta\in E_G^-\setminus E_G^+}p(\bar{\beta})\times\Pi_{\gamma\in B^\prime}p(\gamma)\times \Pi_{\xi\in I\setminus B^\prime}p(\bar{\xi}) \times\Pi_{\zeta\in B^{\prime\prime}}p(\zeta)\times \Pi_{\eta\in E_G^+\setminus B^{\prime\prime}}p(\bar{\xi}) )$$. Since $$ \Sigma_{B^{\prime\prime}\in 2^{E_G^+}} (\Pi_{\zeta\in B^{\prime\prime}}p(\zeta)\times \Pi_{\eta\in E_G^+\setminus B^{\prime\prime}}p(\bar{\eta}) ) =1$$, we may conclude that: \begin{eqnarray*} p(E^{co}) &=& \Sigma_{(B\in 2^{I\cup E_G^+})\wedge (\forall \alpha\in B^\prime: \alpha_{G}^-\cap B^\prime\neq\emptyset)}\,p(G_{\downarrow E\cup B})\\ &=& \Sigma_{(B^\prime\in 2^{I})\wedge(B^{\prime\prime}\in 2^{E_G^+})\wedge (\forall \alpha\in B^\prime: \alpha_{G}^-\cap B^\prime\neq\emptyset)}\,p(G_{\downarrow E\cup B^\prime\cup B^{\prime\prime}})\\ &=& \Sigma_{(B^\prime\in 2^{I})\wedge(B^{\prime\prime}\in 2^{E_G^+})\wedge (\forall \alpha\in B^\prime: \alpha_{G}^-\cap B^\prime\neq\emptyset)}\,(\Pi_{\alpha\in E}p(\alpha)\times \Pi_{\beta\in E_G^-\setminus E_G^+}p(\bar{\beta})\times \\ &&\Pi_{\gamma\in B^\prime}p(\gamma)\times \Pi_{\xi\in I\setminus B^\prime}p(\bar{\xi}) \times\Pi_{\zeta\in B^{\prime\prime}}p(\zeta)\times \Pi_{\eta\in E_G^+\setminus B^{\prime\prime}}p(\bar{\xi}) )\\ &=& (\Pi_{\alpha\in E}p(\alpha)\times \Pi_{\beta\in E_G^-\setminus E_G^+}p(\bar{\beta})) \times \Sigma_{B^{\prime\prime}\in 2^{E_G^+}}(\Pi_{\zeta\in B^{\prime\prime}}p(\zeta)\times \Pi_{\eta\in E_G^+\setminus B^{\prime\prime}}p(\bar{\eta}) )\times \\ && \Sigma_{(B^\prime\in 2^{I})\wedge (\forall \alpha\in B^\prime: \alpha_{G}^-\cap B^\prime\neq\emptyset)}(\Pi_{\gamma\in B^\prime}p(\gamma)\times \Pi_{\xi\in I\setminus B^\prime}p(\bar{\xi}) ) \\ &=& P_E\times 1 \times P_{I\_CO} \\ &= & P_E\times P_{I\_CO}. \end{eqnarray*} ■ Third, under preferred semantics, according to Prop1, Prop2, Prop4 and Prop5, we have the following proposition. Proposition 9 Let $$G^p = (A,R, p)$$ be a PrAG, and $$E\subseteq A$$ be a conflict-free set of arguments. It holds that: \begin{eqnarray} p(E^{pr}) &=& P_E \times P_{I\_PR}, \mbox{where} \nonumber\\ P_E &=& \Pi_{\alpha\in E}p(\alpha)\times\Pi_{\beta\in E_G^-\setminus E_G^+}p(\bar{\beta}), \mbox{and} \nonumber \\ P_{I\_PR} &=& \Sigma_{(B^\prime\in 2^I)\wedge (\forall \alpha\in B^\prime: \alpha_{G}^-\cap B^\prime\neq\emptyset)\wedge (\mathcal{E}_{ad}(G_{\downarrow B^\prime}) = \{\emptyset\})} (\Pi_{\gamma\in B^\prime}p(\gamma)\times \Pi_{\xi\in I\setminus B^\prime}p(\bar{\xi})) .\nonumber \end{eqnarray} The proof of Proposition 9 is similar to that of Proposition 8, omitted. Third, under grounded semantics, according to Prop1, Prop2, Prop4 and Prop6, we have the following proposition. Proposition 10 Let $$G^p = (A,R, p)$$ be a PrAG, and $$E\subseteq A$$ be a conflict-free set of arguments. It holds that: \begin{eqnarray}\label{formula-n-11e} p(E^{gr}) &=& p(E^{co}) \times P_{GR}, \mbox{where} \nonumber \\ P_{GR} &=& \Sigma_{(B^{\prime\prime}_2\in 2^{E_G^+\cap E_G^-})\wedge (\mathcal{E}_{gr}(G_{\downarrow E\cup B^{\prime\prime}}) = \{\{E\}\})} (\Pi_{\alpha\in B^{\prime\prime}}p(\alpha)\times \Pi_{\beta\in (E_G^+\cap E_G^-)\setminus B^{\prime\prime}}p(\bar{\beta})). \nonumber \end{eqnarray} The proof of Proposition 10 is similar to that of Proposition 8. The difference is that $$B^{\prime\prime}$$ is divided into two parts: $$B^{\prime\prime}_1$$ and $$B^{\prime\prime}_2$$, in which the arguments in $$B^{\prime\prime}_1$$ appear without constraints while the arguments in $$B^{\prime\prime}_2$$ appear only when $$\mathcal{E}_{gr}(G_{\downarrow E\cup B^{\prime\prime}}) = \{\{E\}\}$$ is satisfied. This is reflected by the factor $$P_{GR}$$ and an equation $$ \Sigma_{B^{\prime\prime}_1\in 2^{E_G^+\setminus E_G^-}} (\Pi_{\alpha\in B^{\prime\prime}_1}p(\alpha)\times \Pi_{\beta\in (E_G^+\setminus E_G^-)\setminus B^{\prime\prime}_1}p(\bar{\beta}) ) =1$$. 5 Algorithms and empirical results The theoretical results presented in the previous section show that our characterized subgraphs based approach (called C-Sub approach) could be more efficient than the possible worlds based approach (called PW approach). To quantitatively evaluate the performance of our approach, in this section, by taking the cases under preferred semantics as an example, we first develop two algorithms for the PW approach and the C-Sub approach under preferred semantics respectively, and then conduct experiments to obtain the empirical results.5 5.1 Algorithm for the PW approach under preferred semantics Algorithm 1 is an algorithm for the PW approach under preferred semantics. In this algorithm, up to $$2^n$$ subgraphs are blindly constructed where $$n$$ is the number of nodes of the PrAG. For each subgraph $$G_{\downarrow A^\prime}$$, if $$E\subseteq A^\prime$$, then whether $$E$$ is one of its preferred extensions is verified by the procedure $$\mathit{verify\_preferred\_labelling}(\mathcal{L}, E)$$. This procedure is based on the MC algorithm introduced in Section 2. $$\mathcal{L}$$ is initialized as $$(A^\prime, \emptyset, \emptyset)$$, i.e. all arguments in $$A^\prime$$ are all labelled IN. Then, the procedure first checks whether there is an argument $$\alpha$$ in $$E$$ such that $$\alpha$$ is super-illegally IN with respect to $$\mathcal{L}$$. If so, $$E$$ is not a preferred extension. Otherwise, there are two possible cases. First, no argument is illegally IN. It follows that $$in(\mathcal{L})$$ is admissible. In this case, if $$E\subset in(\mathcal{L})$$, then $$E$$ is not a preferred extension. Second, there are some arguments that are illegally IN. In this case, the procedure iteratively selects arguments that are illegally IN (or super-illegally IN) and applies a transition step to obtain a new labelling, until a labelling is reached in which no argument is illegally IN. Algorithm 1 View largeDownload slide Algorithm for the PW approach under preferred semantics Algorithm 1 View largeDownload slide Algorithm for the PW approach under preferred semantics 5.2 Algorithm for the C-Sub approach under preferred semantics Algorithm 2 is an algorithm for the C-Sub approach under preferred semantics. Unlike the PW approach, the algorithm first gets a set of remaining argument $$I = A\setminus (E^-\cup E^+\cup E)$$. Then, for each subset $$B^\prime$$ of $$I$$, verify whether the subgraph induced by $$B^\prime$$ has an non-empty admissible extension. The procedure $$\mathit{verify\_nonempty\_adm}((\mathcal{L})$$ recursively selects arguments that are illegally IN (or super-illegally IN) and applies a transition step to obtain a new labelling, until a lablling is reached in which no argument is illegally IN. If there is a labelling $$\mathcal{L}$$ such that $$\mathcal{L}$$ has no argument that is illegally $$\mathrm{IN}$$ and $$in(\mathcal{L})\neq \emptyset$$, then the procedure returns true. Otherwise, it returns false. Then, $$p(E^{pr})$$ is computed according to Proposition 9. More specifically, in Steps 11 and 12, $$P_E$$ is computed; from Step 13 to Step 17, $$P_{I\_PR}$$ and $$p(E^{pr})$$ are computed. Algorithm 2 View largeDownload slide Algorithm for C-Sub approach under preferred semantics Algorithm 2 View largeDownload slide Algorithm for C-Sub approach under preferred semantics 5.3 Empirical results The algorithms were implemented in Java, and tested on a machine with an Intel CPU running at 2.26 GHz and 2.00 GB RAM. We conducted three experiments to test the performance of out C-Sub approach. The first experiment is about the average computation time of the C-Sub approach and that of the PW approach, according to the following configuration of PrAGs: The number of nodes of PrAGs is from 10 to 25 (since when the number of nodes is smaller than 10, the computation time of the two approaches is close to 0 millisecond, while the number of nodes is bigger than 25, the computation time of the PW approach is almost always more than 3 minutes which we set as the point of timeout). The ratios of the number of edges to the number of nodes are 1:1, 2:1 and 3:1 respectively (since the density of PrAGs is an important factor affecting the average computation time of the two approaches). The size of the extension is 3. This number is selected somewhat arbitrarily. How the size of the extension affects the average computation time of the two approaches will be studied in another experiment. This configuration consists of $$16\times 3\times 1 = 48$$ assignments for the two approaches respectively. Each assignment is a tuple $$(\mbox{#nodes}, i:1, j)$$, where ‘#nodes’ is the number of nodes, $$i:1$$ is the ratio of the number of edges to the number of nodes, and $$j$$ is the size of the extension. For convenience, we use PW_$$j [i:1]$$ (C-Sub_$$j [i:1]$$) to denote the (average) computation time of the PW approach (resp. the C-Sub approach) when the size of the extension is $$j$$ and the the ratio of the number of edges to the number of nodes is $$i:1$$, and the number of nodes is given. For each assignment, the algorithms were executed 20 times respectively. In each time, a PrAG (including its notes, edges, and the probabilities of nodes) and a conflict-free set $$E$$ of arguments were generated at random. For simplicity, the probabilities assigned to nodes are non-zero. Then, the probability of $$E$$ being a preferred extension was computed by the PW approach and the C-Sub approach respectively. Table 3 shows the average execution time of the two approaches. Table 3. The average execution time of the PW approach and the C-Sub approach # No. of nodes PW_3 [1:1] (secs/ timeout) PW_3 [2:1] (secs/ timeout) PW_3 [3:1] (secs/ timeout) C-Sub_3 [1:1] (secs/ timeout) C-Sub_3 [2:1] (secs/ timeout) C-Sub_3 [3:1] (secs/ timeout) 10 0.015/0 0.120/0 0.585/0 0.001/0 0.000/0 0.000/0 11 0.039/0 0.648/0 4.346/0 0.000/0 0.000/0 0.000/0 12 0.070/0 3.141/0 34.662/0 0.002/0 0.001/0 0.000/0 13 0.160/0 6.732/0 $$\underline{101.667}/6$$ 0.006/0 0.005/0 0.000/0 14 0.380/0 $$\underline{23.879}/1$$ $$\underline{154.271}/13$$ 0.000/0 0.000/0 0.001/0 15 4.772/0 $$\underline{87.185}/8$$ /20 0.003/0 0.002/0 0.002/0 16 2.236/0 $$\underline{112.569}/11$$ /20 0.001/0 0.003/0 0.000/0 17 11.674/0 $$\underline{107.201}/9$$ /20 0.003/0 0.003/0 0.001/0 18 $$\underline{18.445}/1$$ $$\underline{149.583}/16$$ /20 0.012/0 0.003/0 0.019/0 19 $$\underline{31.282}/1$$ $$\underline{159.580}/17$$ /20 0.015/0 0.011/0 0.023/0 20 $$\underline{50.973}/2$$ /20 /20 0.028/0 0.477/0 0.211/0 21 $$\underline{89.654}/5$$ /20 /20 0.088/0 0.067/0 $$\underline{11.665}/1$$ 22 $$\underline{143.039}/10$$ /20 /20 0.106/0 $$\underline{14.925}/1$$ $$\underline{10.043}/1$$ 23 /20 /20 /20 0.627/0 6.901/0 $$\underline{13.825}/1$$ 24 /20 /20 /20 3.067/0 $$\underline{12.434}/1$$ $$\underline{0.741}/0$$ 25 /20 /20 /20 1.406/0 $$\underline{30.222}/3$$ $$\underline{15.429}/1$$ # No. of nodes PW_3 [1:1] (secs/ timeout) PW_3 [2:1] (secs/ timeout) PW_3 [3:1] (secs/ timeout) C-Sub_3 [1:1] (secs/ timeout) C-Sub_3 [2:1] (secs/ timeout) C-Sub_3 [3:1] (secs/ timeout) 10 0.015/0 0.120/0 0.585/0 0.001/0 0.000/0 0.000/0 11 0.039/0 0.648/0 4.346/0 0.000/0 0.000/0 0.000/0 12 0.070/0 3.141/0 34.662/0 0.002/0 0.001/0 0.000/0 13 0.160/0 6.732/0 $$\underline{101.667}/6$$ 0.006/0 0.005/0 0.000/0 14 0.380/0 $$\underline{23.879}/1$$ $$\underline{154.271}/13$$ 0.000/0 0.000/0 0.001/0 15 4.772/0 $$\underline{87.185}/8$$ /20 0.003/0 0.002/0 0.002/0 16 2.236/0 $$\underline{112.569}/11$$ /20 0.001/0 0.003/0 0.000/0 17 11.674/0 $$\underline{107.201}/9$$ /20 0.003/0 0.003/0 0.001/0 18 $$\underline{18.445}/1$$ $$\underline{149.583}/16$$ /20 0.012/0 0.003/0 0.019/0 19 $$\underline{31.282}/1$$ $$\underline{159.580}/17$$ /20 0.015/0 0.011/0 0.023/0 20 $$\underline{50.973}/2$$ /20 /20 0.028/0 0.477/0 0.211/0 21 $$\underline{89.654}/5$$ /20 /20 0.088/0 0.067/0 $$\underline{11.665}/1$$ 22 $$\underline{143.039}/10$$ /20 /20 0.106/0 $$\underline{14.925}/1$$ $$\underline{10.043}/1$$ 23 /20 /20 /20 0.627/0 6.901/0 $$\underline{13.825}/1$$ 24 /20 /20 /20 3.067/0 $$\underline{12.434}/1$$ $$\underline{0.741}/0$$ 25 /20 /20 /20 1.406/0 $$\underline{30.222}/3$$ $$\underline{15.429}/1$$ Since in many cases, the execution time might last very long, to make the test possible, when the time for computing $$p(E^{pr})$$ is over 3 minutes (180 seconds), the execution was stopped by setting a break in the program. When the number of timeout is less than 20, the average time was recorded, and for each timeout, the time used for calculation is 180 seconds. For instance, when #nodes = 25, C-Sub_3 [3] = 15.828 seconds. The detailed records of 20 times of execution are shown in Table 4. For instance, C-Sub_3 [3] = (0.016 + 3.760 + 0.000 + 0.015 + 22.074 + 0.016 + 24.039 + 0.078 + 180 + 4.524 + 43.275 + 0.000 + 0.000 + 0.016 + 0.000 + 0.015 + 0.000 + 30.732 + 0.016 + 0.000) $$\div 20 =15.429$$. Table 4. The detailed records of the execution time of the C-Sub approach. In this table, ‘max $$|B^\prime|$$’ and ‘avg. $$|B^\prime|$$’ denote respectiely the maximal and average size of $$B^\prime$$. No. C-Sub_3 [3:1] (#nodes = 25) C-Sub_3 [2:1] (#nodes = 25) Time (secs) Max $$|B^\prime|$$ Avg. $$|B^\prime|$$ Time (secs) Max $$|B^\prime|$$ Avg. $$|B^\prime|$$ 1 0.016 8 4 Timeout 15 1 2 3.760 12 6 0.640 15 7 3 0.000 10 5 0.000 10 5 4 0.015 7 3 0.281 16 8 5 22.074 11 5 0.000 11 5 6 0.016 10 5 4.339 13 6 7 24.039 11 5 57.424 14 7 8 0.078 11 5 0.078 14 7 9 Timeout 13 5 Timeout 16 1 10 4.524 11 5 0.000 10 5 11 43.275 14 7 0.031 13 6 12 0.000 9 4 0.047 14 7 13 0.000 9 4 0.125 15 7 14 0.016 9 4 0.047 14 7 15 0.000 11 5 1.310 13 6 16 0.015 11 5 Timeout 16 3 17 0.000 9 4 0.047 13 6 18 30.732 12 6 0.031 12 6 19 0.016 9 4 0.016 12 6 20 0.000 10 5 0.062 11 5 avg. 15.429 10.35 30.222 13.35 No. C-Sub_3 [3:1] (#nodes = 25) C-Sub_3 [2:1] (#nodes = 25) Time (secs) Max $$|B^\prime|$$ Avg. $$|B^\prime|$$ Time (secs) Max $$|B^\prime|$$ Avg. $$|B^\prime|$$ 1 0.016 8 4 Timeout 15 1 2 3.760 12 6 0.640 15 7 3 0.000 10 5 0.000 10 5 4 0.015 7 3 0.281 16 8 5 22.074 11 5 0.000 11 5 6 0.016 10 5 4.339 13 6 7 24.039 11 5 57.424 14 7 8 0.078 11 5 0.078 14 7 9 Timeout 13 5 Timeout 16 1 10 4.524 11 5 0.000 10 5 11 43.275 14 7 0.031 13 6 12 0.000 9 4 0.047 14 7 13 0.000 9 4 0.125 15 7 14 0.016 9 4 0.047 14 7 15 0.000 11 5 1.310 13 6 16 0.015 11 5 Timeout 16 3 17 0.000 9 4 0.047 13 6 18 30.732 12 6 0.031 12 6 19 0.016 9 4 0.016 12 6 20 0.000 10 5 0.062 11 5 avg. 15.429 10.35 30.222 13.35 From Table 3, we found that the C-Sub approach greatly outperforms the PW approach. The computation time of the PW approach increases dramatically with the increase of the number of nodes and the density of edges. More specifically, when the number of nodes is given, PW_3 [$$i:1$$] increases sharply with the increase of $$i$$. For instance, when #nodes = 15, PW_3 [$$1:1$$] = 4.772, PW_3 [$$2:1$$] = 87.185 (with 8 timeouts), and PW_3 [$$3:1$$] has no record of time (with 20 timeouts). Meanwhile, when the density of edges is given, PW_3 [$$i:1$$] ($$i = 1, 2, 3$$) increases exponentially with the increase of #nodes. On the contrary, with the increase of density (i.e. $$i:1$$), C-Sub_3 [$$i:1$$] might not increase. And, with the increase of the number of nodes, PW_3 [$$i:1$$] ($$i = 1, 2, 3$$) does not increase exponentially. The basic reason behind these phenomena is that according to the theoretical results obtained in Section 4, compared to the PW approach, the complexity of the C-Sub approach decreases from $$|2^A|$$ to $$|2^I|$$. In other words, the complexity of the C-Sub approach is manly determined by the size of $$I$$ (i.e., the maximal size of $$B^\prime$$). This is evidenced by the data shown in Table 4, in which the average value of maximal sizes of $$B^\prime$$ in 20 tests is 10.35 for C-Sub_3 [$$3:1$$] and 13.35 for C-Sub_3 [$$2:1$$], which matches very well to the average computation time of C-Sub_3 [$$3:1$$] (15.429 seconds) and C-Sub_3 [$$2:1$$] (30.222 seconds). Figure 6. View largeDownload slide Plots showing the execution time of the PW approach [31] and the C-Sub approach. Figure 6. View largeDownload slide Plots showing the execution time of the PW approach [31] and the C-Sub approach. The second experiment is to further study how the increase of density of PrAGs affects the computation time of the two approaches. As shown in Table 5 and Figure 7, the configuration for the PW approach is: the size of extension is 3, the number of nodes is 10 and the density of edges ranges from $$1:1$$ to $$6:1$$. The configuration of the C-Sub approach is similar to that of the PW approach, the only difference is that the number of nodes is 20 for the C-Sub approach (in that when the number of nodes is less than 10, the average computation time of the PW approach is close to 0). The average execution time of the PW approach increases sharply with the increase of the density of edges, while the execution time of the C-Sub approach decreases with the increase of the density of edges. Figure 7. View largeDownload slide Plot showing the average execution time of the PW approach and the C-Sub approach w.r.t. the changing of density of edges. Figure 7. View largeDownload slide Plot showing the average execution time of the PW approach and the C-Sub approach w.r.t. the changing of density of edges. Table 5. Average execution time of the PW approach and the C-Sub approach w.r.t. the changing of density of edges $$i:1$$ 1:1 2:1 3:1 4:1 5:1 6:1 PW_3 [$$i:1$$] (secs) #nodes = 10 0.026 0.141 0.694 1.641 2.781 4.056 C-Sub_3[$$i:1$$] (secs) #nodes = 20 0.255 0.367 0.090 0.014 0.003 0.001 $$i:1$$ 1:1 2:1 3:1 4:1 5:1 6:1 PW_3 [$$i:1$$] (secs) #nodes = 10 0.026 0.141 0.694 1.641 2.781 4.056 C-Sub_3[$$i:1$$] (secs) #nodes = 20 0.255 0.367 0.090 0.014 0.003 0.001 The third experiment is study how the average execution time of the PW approach and the C-Sub approach changes with respect to the changing of the size of the extension. In this experiment, the configuration for the two approaches is: the size of extension is 3 and 5, the number of nodes ranges from 10 to 25, and the density of edges is $$2:1$$. According to the results shown Figure 8 (corresponding to the data in Table 6), the shapes of the graphs PW_3 [2:1] and PW_5 [2:1] are almost the same, which means that the average execution time of the PW approach does not fundamentally decrease with the changing of the size of the extension. On the contrary, the average execution time of the C-Sub approach decreases to a great extent. The basic reason behind this phenomenon is that: since the complexity of the C-Sub approach is manly determined by the size of $$I = A\setminus (E\cup E_G^+\cup E_G^-)$$, with the increase of the size the extension $$E$$, the size of $$I$$ become smaller. Figure 8. View largeDownload slide Plots showing the average execution time of the PW approach and the C-Sub approach with respect to different sizes of the extension. Figure 8. View largeDownload slide Plots showing the average execution time of the PW approach and the C-Sub approach with respect to different sizes of the extension. Table 6. The average execution time of the PW approach and the C-Sub approach with respect to different sizes of the extension # No. of nodes PW_3 [2:1] (secs/timeout) PW_5 [2:1] (secs/timeout) C-Sub_3 [2:1] (secs/timeout) C-Sub_5 [2:1] (secs/timeout) 10 0.120/0 0.018/0 0.000/0 0.000/0 11 0.648/0 0.042/0 0.000/0 0.000/0 12 3.141/0 0.125/0 0.001/0 0.000/0 13 6.732/0 0.368/0 0.005/0 0.000/0 14 $$\underline{23.879}/1$$ 4.178/0 0.000/0 0.000/0 15 $$\underline{87.185}/8$$ 3.723/0 0.002/0 0.000/0 16 $$\underline{112.569}/11$$ $$\underline{43.981}/2$$ 0.003/0 0.002/0 17 $$\underline{107.201}/9$$ $$\underline{70.016}/5$$ 0.003/0 0.000/0 18 $$\underline{149.583}/16$$ $$\underline{93.756}/8$$ 0.003/0 0.000/0 19 $$\underline{159.580}/17$$ $$\underline{108.857}/10$$ 0.011/0 0.003/0 20 /20 $$\underline{151.422}/15$$ 0.477/0 0.000/0 21 /20 $$\underline{155.704}/16$$ 0.067/0 0.000/0 22 /20 $$\underline{171.270}/16$$ $$\underline{14.925}/1$$ 0.003/0 23 /20 /20 6.091/0 0.001/0 24 /20 /20 $$\underline{12.434}/1$$ 0.222/0 25 /20 /20 $$\underline{30.222}/3$$ 0.008/0 # No. of nodes PW_3 [2:1] (secs/timeout) PW_5 [2:1] (secs/timeout) C-Sub_3 [2:1] (secs/timeout) C-Sub_5 [2:1] (secs/timeout) 10 0.120/0 0.018/0 0.000/0 0.000/0 11 0.648/0 0.042/0 0.000/0 0.000/0 12 3.141/0 0.125/0 0.001/0 0.000/0 13 6.732/0 0.368/0 0.005/0 0.000/0 14 $$\underline{23.879}/1$$ 4.178/0 0.000/0 0.000/0 15 $$\underline{87.185}/8$$ 3.723/0 0.002/0 0.000/0 16 $$\underline{112.569}/11$$ $$\underline{43.981}/2$$ 0.003/0 0.002/0 17 $$\underline{107.201}/9$$ $$\underline{70.016}/5$$ 0.003/0 0.000/0 18 $$\underline{149.583}/16$$ $$\underline{93.756}/8$$ 0.003/0 0.000/0 19 $$\underline{159.580}/17$$ $$\underline{108.857}/10$$ 0.011/0 0.003/0 20 /20 $$\underline{151.422}/15$$ 0.477/0 0.000/0 21 /20 $$\underline{155.704}/16$$ 0.067/0 0.000/0 22 /20 $$\underline{171.270}/16$$ $$\underline{14.925}/1$$ 0.003/0 23 /20 /20 6.091/0 0.001/0 24 /20 /20 $$\underline{12.434}/1$$ 0.222/0 25 /20 /20 $$\underline{30.222}/3$$ 0.008/0 6 Computational properties Based on the theory and the experimental results introduced in Sections 4 and 5, in this section, we briefly analyse some computational properties of our C-Sub approach (or briefly ‘our approach’). On the one hand, according to classical complexity theory, by using the C-Sub approach, it holds that computing $$p(E^{ad})$$ and $$p(E^{st})$$ is polynomial time tractable, while under complete, preferred and grounded semantics, problems of determining $$p(E^{co})$$, $$p(E^{pr})$$ and $$p(E^{gr})$$ are still intractable. This is because: under complete and preferred semantics, we need to consider $$|2^I|$$ cases, while under grounded semantics, $$|2^I|+|2^{E_G^+\cap E_G^-}|$$ cases. However, theoretically, the C-Sub approach is more efficient, in that: (1) most subgraphs are not necessary to be constructed and computed, i.e., the maximal number of subgraphs decreases from $$|2^A|$$ to $$|2^I|$$ (or $$|2^I|+|2^{E_G^+\cap E_G^-}|$$), where $$I = A\setminus (E\cup E_G^+\cup E_G^-)$$ is the set of remaining arguments; and (2) the size of the maximal subgraph decreases from $$|A|$$ to $$|I|$$ (or $$|E_G^+\cap E_G^-|$$). The efficiency of the C-Sub approach is evidenced by the empirical results. This approach not only dramatically decreases the time for computing $$p(E^\sigma)$$, but also has an attractive property, which is contrary to that of existing approaches: the denser the edges of a PrAG are or the bigger the size of a given extension $$E$$ is, the more efficient our approach computes $$p(E^\sigma)$$. On the other hand, under complete and preferred semantics, since the complexity of the C-Sub approach is mainly determined by the size of the remaining arguments, which is usually much smaller than that of the whole set of arguments in a PrAG, according to parameterized complexity theory, the problems of determining $$p(E^{co})$$ and $$p(E^{pr})$$ in the C-Sub approach are fixed-parameter tractable with respect to the size of remaining arguments. Details are as follows. In terms of parameterized complexity theory, the complexity of a problem is not only measured in terms of the input size, but also in terms of a parameter. The theory’s focus is on situations where the parameter can be assumed to be small [19]. Let $$Q$$ be a classical problem, and $$k$$ be a parameter of the problem. A parameterized problem is denoted as $$(Q, k)$$. When binding $$k$$ to a fixed constant, in many cases, an intractable problem $$Q$$ can be made tractable. This property is called fixed-parameter tractability (FPT). More specifically, let $$n$$ be the input size of a problem, and $$f$$ be a computable function that depends on a parameter $$k$$ of the problem. The complexity class FTP consists of problems that can be computed in $$f(k)\cdot n^{\mathcal{O}(1)}$$. In the setting of this article, let $$k = |I|$$. Typically, $$k$$ is much smaller than the size of the PrAG (i.e. $$|A|$$). Under complete and preferred semantics, the complexity of determining the probability that a set of arguments is an extension is dominated by the size of the set of remaining arguments (i.e. $$|I|$$). Formally, we have the following proposition. Proposition 11 Let $$G^p = (A,R, p)$$ be a PrAG, and $$E\subseteq A$$ be a conflict-free set of arguments. Let $$k = |I|$$ where $$I$$ is the set of remaining arguments of $$G$$ with respect to $$E$$. Let $$Pr_G(E^{co})$$ and $$ Pr_G(E^{pr})$$ be the problems of determining the probability $$p(E^{co})$$ and $$p(E^{pr})$$ respectively. It holds that $$(Pr_G(E^{co}), k)$$ and $$(Pr_G(E^{pr}), k)$$ belong to FTP. Proof. First, under preferred semantics, the algorithm (Algorithms 2) consists of the following two parts. The first part (Lines 2 – 10; Lines 18 – 33) is the difficult core of the algorithm. In this part, there are $$2^k$$ calls and in each call, the procedure $$\mathit{verify\_nonempty\_adm}(\mathcal{L})$$ may be intractable. However, since the size of the subgraphs induced by $$B^\prime$$ is less than $$k$$, the time for executing $$\mathit{verify\_nonempty\_adm}(\mathcal{L})$$ is dependent on $$k$$, denoted as $$g(k)$$. The second part (Line 1, Lines 11 – 17) is tractable. The execution time of this part can be bounded by $$n^{\mathcal{O}(1)}$$ where $$n=|A|$$. So, the overall execution time can be bounded by $$2^k\cdot g(k) + n^{\mathcal{O}(1)}= f(k)+ n^{\mathcal{O}(1)}\leq f(k)\cdot n^{\mathcal{O}(1)}$$ where $$f(k) = 2^k\cdot g(k) $$. Hence, $$(Pr_G(E^{pr}), k)$$ belongs to FTP. Second, in terms of Propositions 8 and 9, the algorithm under complete semantic (not presented in the present article) is similar to the one under preferred semantics. The difference is that under complete semantics, $$\mathit{verify\_nonempty\_adm}(\mathcal{L})$$ is not executed. So, it holds that $$(Pr_G(E^{co}), k)$$ belongs to FTP. ■ Note that under grounded semantics, since usually it may be not the case that $$\max\{|E^+_G\cap E^-_G|, |I|\}$$ is much smaller than $$|A|$$, Proposition 11 cannot be applied to grounded semantics. 7 Related work In this article, we have proposed a new approach (the C-Sub approach) to formulate semantics of probabilistic argumentation, and analysed its computational properties on the basis of an empirical study. To the best of our knowledge, our approach is the first attempt to systematically study how to compute the semantics of probabilistic argumentation without (or with less) construction and computation of subgraphs not only under admissible and stable semantics, but also under other semantics including complete, grounded and preferred. In this section, we give a discussion about some related work. Independence assumption of arguments In this article, we assume the independence of arguments appearing in a graph. A theoretical foundation for this assumption is originally formulated by Anthony Hunter in a series of his work [22–24] from the justification perspective on the probability of an argument: For an argument $$\alpha$$ in a graph $$G$$, with a probability assignment $$p$$, $$p(\alpha)$$ is treated as the probability that $$\alpha$$ is a justified point (i.e. each is a self-contained, internally valid, contribution) and therefore should appear in the graph, and $$1-p(\alpha)$$ is the probability that $$\alpha$$ is not a justified point and so should not appear in the graph. This means the probabilities of the arguments being justified are independent (i.e., knowing that one argument is a justified point does not affect the probability that another is a justified point). The justification perspective can be further illustrated by the following example that was originally presented in [22]. Given two arguments $$\alpha_1 = (\{p\}, p)$$ and $$\alpha_2 = (\{\neg p\}, \neg p)$$ constructing from a knowledge base containing just two formulae $$\{p, \neg p\}$$, $$\alpha_1$$ attacks $$\alpha_2$$ and vice versa. In terms of classical logic, it is not possible that both arguments are true, but each of them is a justified point. So even though logically $$\alpha_1$$ and $$\alpha_2$$ are not independent (in the sense that if one is known to be true, then the other is known to be false), they are independent as justified points. In existing literature, some models and algorithms depend on an independence assumption of arguments and/or attacks [16, 18, 22, 23, 26], while others do not [21, 24, 33, 34]. For the former, probabilities are assigned to arguments and/or attacks, and the probability distribution over subgraphs can be generated based on the independence assumption. For the latter, users directly specify the unique probability distribution over the set of subgraphs. There are pros and cons about whether the independence assumption is used or not. On the one hand, by using the independence assumption, it can be more efficient to use the probability assignment to arguments and/or attacks and then generate the probability distribution over subgraphs. But, as discussed in [24], while the independence assumption is useful in some situations, it is not always appropriate. On the other hand, when the independence assumption is avoided, the dependence relation between arguments can be properly represented. However, in this way, users have to specify probability distribution over the set of subgraphs, whose number is exponential with respect to the arguments and/or attacks. And, in many cases users may not be aware of the probability value that should be assigned to a possible world (subgraph) which may represent a complex scenario [17]. In this sense, in many situations, the models without independence assumption might not be applicable. So, with regard to whether an independence assumption is used or not, there are both advantages and disadvantages. Complexity analysis and algorithms for probabilistics argumentation Computational issues of probabilistic argumentation have been deeply investigated in recent years. On the one hand, Fazzinga et al. studied the complexity problem of determining the probability that a set of arguments is an extension under a given semantics [16]. The results show that under admissible and stable semantics, the problem belongs to $$\mathit{PTIME}$$, while under complete, grounded, preferred and ideal semantics, the problem is $$\mathit{FP}^{\sharp P}$$. However, the existing work only studied the complexity problems from the perspective of classical complexity theory. The corresponding problems from the perspective of parameterized complexity theory have not been explored. On the other hand, since using a brute-force algorithm to evaluate the probability of a set of arguments being an extension is computationally prohibitive, in existing work, an approximate approach (called the Monte-Carlo simulation approach) has been proposed to cope with this problem [26], which was significantly improved in [18] by reducing the sample space of computation. Corresponding to these approximate approaches, however, little attention has been paid to the development of exact approaches. Our approach presented in this article is a first step in this direction. Efficient algorithms based on the structural properties of graphs Since an abstract argumentation framework (argument graph) can be viewed as a digraph, applying various properties of existing graph theory to argumentation is not new. For instance, when an argument graph satisfies some properties (acyclic, symmetric, bipartite, etc.), there exist tractable algorithms to compute its semantics [4, 9]; when an argument graph has bounded tree-width, there exist fixed-parameter algorithms [13]; when decomposing an argument graph based on the notion of strongly connected components, the efficiency of computation can be significantly improved [27]; by mapping the notion of a kernel, a semikernel and a maximal semikernel in a directed graph [20] respectively to the notion of a stable set, an admissible set and a preferred extension in an argumentation framework [5, 15], in terms of [6], we may infer that the complexity results and algorithms related to kernels and semikernels can be applied to formal argumentation. Beside the structural properties that have been applied to argumentation, notions of kernels and semikernels have also been connected to logic programs and default theories. According to [6], every normal logic program can be transformed into a graph. The stable, partial stable and well-founded semantics correspond to kernels, semikernels and the initial acyclic part, respectively. Meanwhile, according to [35], it is an equivalence relation between the problem of the existence of kernels in digraphs and satisfiability of propositional theories (SAT). Thanks to this relation, algorithms for computing kernels can be applied to computing the semantics of logic programs. It is worth to note that although structural properties of digraphs have been exploited in Dung’s abstract argumentation [7], we have not found solutions to apply these properties to the efficient computation of the semantics of probabilistic argumentation. So, in this article, based on some basic structural properties of digraphs and formal argumentation [7, 20], we have defined properties that can be used to characterize subgraphs of a PrAG. These properties are established in the setting of probabilistic argumentation where the appearance of arguments is related to a given extension $$E$$, and on the basis of the original definition of extensions under different argumentation semantics [7]. Despite of their simplicity, these properties lay a concrete foundation to define a new methodology to formulate and compute the semantics of probabilistic argumentation. Kernelization and parameterized algorithms The approach and results presented in this article have a close relation to some existing work on kernelization and parameterized algorithms, which have been extensively studied in the past two decades. Kernelization is a systematic approach to study polynomial-time preprocessing algorithms, such that the ‘easy parts’ of a problem instance can be solved efficiently, and the problem instance is reduced to its computationally difficult ‘core’ structure (the problem kernel of the instance) [30]. If the size of the kernel can be effectively bounded in terms of a fixed-parameter alone, then the problem is fixed-parameter tractable (FPT) [19]. In recent years, fixed-parameter algorithms were developed in the setting of Dung’s abstract argumentation, by exploiting some important parameters for graph problems, such as the tree-width [9, 13] and the clique-width [12, 14] of a graph. The C-Sub approach presented in this article can be understood as a kind of kernelization. The novelty of this approach lies in the fact that new properties are defined to characterize the subgraphs of a PrAG with respect to a given extension. 8 Conclusions and future work Probabilistic argumentation is an emerging direction in the area of formal argumentation. In this article, we have studied the formulation and computation of semantics of probabilistic argumentation. The main contributions of this article are two-fold. On the one hand, conceptually, we define specific properties to characterize the subgraphs of a PrAG with respect to a given extension, such that the probability of a set of arguments $$E$$ being an extension can be defined in terms of these properties, without (or with less) construction of subgraphs. The theoretical results in this article show that under admissible and stable semantics, computing a set of arguments being an extension of a PrAG is polynomial time tractable; under complete and preferred semantics, the problems of determining $$p(E^{co})$$ and $$p(E^{pr})$$ in our C-Sub approach are fixed-parameter tractable with respect to the size of remaining arguments. On the other hand, computationally, we take preferred semantics as an example, and develop algorithms to evaluate the efficiency of our approach. The empirical results show that our approach not only dramatically decreases the time for computing the semantics of probabilistic argumentation, but also has an attractive property, which is contrary to that of existing approaches: the denser the edges of a PrAG are or the bigger the size of a set of arguments $$E$$ is, the more efficient our approach computes the probability of $$E$$ being an extension of the PrAG. Future work is as follows. First, in this article we deal with the probabilistic argument graphs (PrAGs) in which probabilities are assigned to arguments. However, when probabilities are assigned to attacks or to both arguments and attacks, the formalisms and algorithms corresponding to the ones in this article are expected to be different. In [24], only attacks are assigned with probabilities. So, it would be interesting to combine the theory presented in [24] with the approach presented in this article. Meanwhile, one may consider to extend our approach to the cases where both arguments and attacks are assigned with probabilities, similar to the work presented in [18]. Second, an independence assumption of arguments is used in the article. Although it is useful in some situations, but not always appropriate. So, a further step is to develop the corresponding approaches without this assumption. Third, as mentioned above, under grounded semantics, we have not obtained a conclusion that our approach is fixed-parameter tractable. Further analysis about this issue is needed. Fourth, in the empirical study, we have only considered preferred semantics. The algorithms and experiments under other semantics (especially grounded semantics) are also important. Acknowledgements We are grateful to the reviewers of this article for their constructive and insightful comments. The research reported in this article was partially supported by the Fundamental Research Funds for the Central Universities of China and the National Research Fund Luxembourg (FNR). Footnotes 1A probabilistic argument graph can be defined by assigning probabilities to arguments [8, 22, 33], or attacks [24], or both arguments and attacks [26]. For simplicity, in this article we only consider the probabilistic argument graph in which only arguments are associated with probabilities. 2In [16], probabilities are assinged to both arguments and attacks. 3It is worth to mention that in recent years, there are various approaches for computing the semantics of argumentation, including reduction approaches (e.g. the alrogithms based on ASP slovers) and direct approaches (e.g. the MC algorithms). Some of them have appeared in the International Competition on Computational Models of Argumentation (http://argumentationcompetition.org/2015/solvers.html). Since the choice of different implemention approaches does not basically affect the empirical results of our approach, for simplicity and without loss of generarity, we only introduce and exploit the MC algorithm for computing preferred labellings. 4The slices of the pie are used to indicate different components related to $$E$$. Their sizes are not important. 5The reasons why we choose preferred semantics for our empirical study here are as follows. First, efficiency of our approaches are mainly affected by the size of the set of remaining arguments, which is mainly dependent on the structure of graphs and the size of the extension, rather than on the semantics we choose. Second, preferred semantics has been widely used in many experiments (e.g. [13], [3] and [32], among others). And, we have also conducted several experiments under preferred semantics [27, 28]. Third, for some other properties, we will study them in our future work. For instance, under grounded semantics, an additonal property is how the efficiency of the new approach is affected by the size of $$E_G^+\cap E_G^-$$. References [1] Baroni P. Caminada M. and Giacomin. M. An introduction to argumentation semantics. The Knowledge Engineering Review , 26, 365– 410, 2011. Google Scholar CrossRef Search ADS [2] Baroni P. Giacomin M. and Guida. G. Scc-recursiveness: a general schema for argumentation semantics. Artificial Intelligence , 168, 162– 210, 2005. Google Scholar CrossRef Search ADS [3] Cerutti F. Giacomin M. Vallati M. Zanella. M. An scc recursive meta-algorithm for computing preferred labellings in abstract argumentation. In Proceedings of the 14th International Conference on Principles of Knowledge Representation and Reasoning, KR 2014 , Baral C. Giacomo G. D. Eiter T. eds, pp. 42– 51. AAAI Press, 2014. [4] Coste-Marquis S. Devred C. and Marquis. P. Symmetric argumentation frameworks. In Proceedings of the 8th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2005) , Godo L. ed., pp. 317– 328. Springer, 2005. Google Scholar CrossRef Search ADS [5] Coste-Marquis S. Devred C. and Marquis. P. Symmetric argumentation frameworks. In Proceedings of the ECSQARU 2005 , pp. 317– 328. Springer, 2005. Google Scholar CrossRef Search ADS [6] Dimopoulos Y. and Torres. A. Graph theoretical structures in logic programs and default theories. Theoretical Computer Science , 170, 209– 214, 1996. Google Scholar CrossRef Search ADS [7] Dung. P. M. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence , 77, 321– 357, 1995. Google Scholar CrossRef Search ADS [8] Dung P. M. and Thang. P. M. Towards (probabilistic) argumentation for jury-based dispute resolution. In Proceedings of the COMMA 2010 , pp. 171– 182. IOS Press, 2010. [9] Dunne. P. E. Computational properties of argument systems satisfying graph-theoretic constraints. Artificial Intelligence , 171, 701– 729, 2007. Google Scholar CrossRef Search ADS [10] Dunne P. E. Hunter A. McBurney P. Parsons S. and Wooldridge. M. Weighted argument systems: basic definitions, algorithms, and complexity results. Artificial Intelligence , 175, 457– 486, 2011. Google Scholar CrossRef Search ADS [11] Dunne P. E. and Wooldridge. M. Complexity of abstract argumentation. In Argumentation in Artificial Intelligence , pp. 85– 104. Springer US, 2009. Google Scholar CrossRef Search ADS [12] Dvořák W. Ordyniak S. and Szeider. S. Augmenting tractable fragments of abstract argumentation. Artificial Intelligence , 186, 157– 173, 2012. Google Scholar CrossRef Search ADS [13] Dvořák W. Pichler R. and Woltran. S. Towards fixed-parameter tractable algorithms for abstract argumentation. Artificial Intelligence , 186, 1– 37, 2012. Google Scholar CrossRef Search ADS [14] Dvořák S. Szeider S. and Woltran. S. Reasoning in argumentation frameworks of bounded clique-width. In Proceedings of the 3rd Conference on Computational Models of Argument, COMMA 2010 , Baroni P. Cerutti F. Giacomin M. Simari G. R. eds, pp. 219– 230. IOS Press, 2010. [15] Dyrkolbotn. S. On a formal connection between truth, argumentation and belief. In Proceedings of the ESSLLI 2012/2013, LNCS 8607 , pp. 69– 90. Springer, 2014. Google Scholar CrossRef Search ADS [16] Fazzinga B. Flesca S. and Parisi. F. On the complexity of probabilistic abstract argumentation. In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence , pp. 898– 904. AAAI Press, 2013. [17] Fazzinga B. Flesca S. and Parisi. F. On the complexity of probabilistic abstract argumentation frameworks. Transactions on Computational Logic , 16, 2015. [18] Fazzinga B. Flesca S. and Parisi. F. On efficiently estimating the probability of extensions in abstract argumentation frameworks. International Journal of Approximate Reasoning , 69, 106– 132, 2016. Google Scholar CrossRef Search ADS [19] Flum J. and Grohe. M. Parameterized Complexity Theory . Springer, 2006. [20] Galeana-Sánchez H. and Neumann-Lara. V. On kernels and semikernels of digraph. Discrete Mathematics , 48, 67– 76, 1984. Google Scholar CrossRef Search ADS [21] Grossi D. and van der Hoek. W. Audience-based uncertainty in abstract argument games. In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence , 143– 149. AAAI Press, 2013. [22] Hunter. A. Some foundations for probabilistic abstract argumentation. In Proceedings of the 4th International Conference on Computational Models of Argument , pp. 117– 128. IOS Press, 2012. [23] Hunter. A. A probabilistic approach to modelling uncertain logical arguments. International Journal of Approximate Reasoning , 54, 47– 81, 2013. Google Scholar CrossRef Search ADS [24] Hunter. A. Probabilistic qualification of attack in abstract argumentation. International Journal of Approximate Reasoning , 55, 607– 638, 2014. Google Scholar CrossRef Search ADS [25] Jakobovits H. and Vermeir. D. Robust semantics for argumentation frameworks. Journal of Logic and Computation , 9, 215– 261, 1999. Google Scholar CrossRef Search ADS [26] Li H. Oren N. and Norman. T. J. Probabilistic argumentation frameworks. In Proceedings of the TAFA 2011 , pp. 1– 16. Springer, 2012. Google Scholar CrossRef Search ADS [27] Liao. B. Toward incremental computation of argumentation semantics: a decomposition-based approach. Annals of Mathematics and Artificial Intelligence , 67, 319– 358, 2013. Google Scholar CrossRef Search ADS [28] Liao B. and Huang. H. Partial semantics of argumentation: basic properties and empirical results. Journal of Logic and Computation , 23, 541– 562, 2013. Google Scholar CrossRef Search ADS [29] Liao B. and Huang. H. Formulating semantics of probabilistic argumentation by characterizing subgraphs. In Proceedings of the LORI 2015 , pp. 243– 254. Springer, 2015. Google Scholar CrossRef Search ADS [30] Lokshtanov D. Marx D. Fomin F. V. Kowalik L. Pilipczuk M. Cygan M. Pilipczuk M. and Saurabh. S. Parameterized Algorithms . Springer, 2015. Google Scholar CrossRef Search ADS [31] Modgil S. and Caminada. M. Proof theories and algorithms for abstract argumentation frameworks. In Argumentation in Artificial Intelligence , Rahwan I. Simari G. R. eds, pp. 105– 129. Springer, 2009. Google Scholar CrossRef Search ADS [32] Nofal S. Atkinson K. and Dunne. P. Algorithms for decision problems in argument systems under preferred semantics. Artificial Intelligence , 207, 723– 51, 2014. Google Scholar CrossRef Search ADS [33] Rienstra. T. Towards a probabilistic dung-style argumentation system. In Proceedings of the AT , pp. 138– 152, 2012. [34] Thimm. M. A probabilistic semantics for abstract argumentation. In European Conference on Artificial Intelligence (ECAI) , pp. 750– 755. AAAI Press, 2012. [35] Walicki M. and Dyrkolbotn. S. Finding kernels or solving sat. Journal of Discrete Algorithms , 10, 146– 164, 2012. Google Scholar CrossRef Search ADS © The Author, 2017. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com This article is published and distributed under the terms of the Oxford University Press, Standard Journals Publication Model (https://academic.oup.com/journals/pages/about_us/legal/notices) For permissions, please e-mail: journals. permissions@oup.com

Journal of Logic and Computation – Oxford University Press

**Published: ** Mar 1, 2018

Loading...

personal research library

It’s your single place to instantly

**discover** and **read** the research

that matters to you.

Enjoy **affordable access** to

over 12 million articles from more than

**10,000 peer-reviewed journals**.

All for just $49/month

Read as many articles as you need. **Full articles** with original layout, charts and figures. Read **online**, from anywhere.

Keep up with your field with **Personalized Recommendations** and **Follow Journals** to get automatic updates.

It’s easy to organize your research with our built-in **tools**.

Read from thousands of the leading scholarly journals from *SpringerNature*, *Elsevier*, *Wiley-Blackwell*, *Oxford University Press* and more.

All the latest content is available, no embargo periods.

## “Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”

Daniel C.

## “Whoa! It’s like Spotify but for academic articles.”

@Phil_Robichaud

## “I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”

@deepthiw

## “My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”

@JoseServera

- Read unlimited articles
- Personalized recommendations
- No expiration
- Print 20 pages per month
- 20% off on PDF purchases
- Organize your research
- Get updates on your journals and topic searches

**$49/month**

Start Free Trial

14-day Free Trial

Best Deal — 39% off
### Annual Plan

- All the features of the Professional Plan, but for
**39% off**! - Billed annually
- No expiration
- For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.

~~$588~~

**$360/year**

Start Free Trial

14-day Free Trial

Read and print from thousands of top scholarly journals.

System error. Please try again!

or

By signing up, you agree to DeepDyve’s Terms of Service and Privacy Policy.

Already have an account? Log in

Bookmark this article. You can see your Bookmarks on your DeepDyve Library.

To save an article, **log in** first, or **sign up** for a DeepDyve account if you don’t already have one.