Research article Special Issues

An efficient algorithm of fuzzy reinstatement labelling

  • The fuzzy reinstatement labelling (FRL) puts forward a reasonable method to rewind the acceptable degrees of arguments in fuzzy argumentation frameworks. The fuzzy labelling algorithm (FLAlg) computes the FRL by infinitely approximating the limits of an iteration sequence. However, the FLAlg is unable to provide an exact FRL, and its computation complexity depends on not only the number of arguments but also the accuracy. This brings a quick increase in complexity when higher accuracy is acquired. In this paper, through the in-depth study of the FLAlg, we introduce an effective algorithm for decomposing FRL by strongly connected components. For simple fuzzy frameworks in the form of trees, odd cycles, and even cycles, the new algorithm provides an exact value of the limit. Therefore, by avoiding the infinite approximation process, it is independent of accuracy. And for complex frames, the new algorithm outputs an approximate value to the FLAlg. It is more efficient because the number of arguments in the approximation process is usually reduced.

    Citation: Shuangyan Zhao, Jiachao Wu. An efficient algorithm of fuzzy reinstatement labelling[J]. AIMS Mathematics, 2022, 7(6): 11165-11187. doi: 10.3934/math.2022625

    Related Papers:

    [1] Sara S. Alzaid, Pawan Kumar Shaw, Sunil Kumar . A numerical study of fractional population growth and nuclear decay model. AIMS Mathematics, 2022, 7(6): 11417-11442. doi: 10.3934/math.2022637
    [2] Muhamad Deni Johansyah, Asep K. Supriatna, Endang Rusyaman, Jumadil Saputra . Application of fractional differential equation in economic growth model: A systematic review approach. AIMS Mathematics, 2021, 6(9): 10266-10280. doi: 10.3934/math.2021594
    [3] Mdi Begum Jeelani, Kamal Shah, Hussam Alrabaiah, Abeer S. Alnahdi . On a SEIR-type model of COVID-19 using piecewise and stochastic differential operators undertaking management strategies. AIMS Mathematics, 2023, 8(11): 27268-27290. doi: 10.3934/math.20231395
    [4] Najat Almutairi, Sayed Saber . Chaos control and numerical solution of time-varying fractional Newton-Leipnik system using fractional Atangana-Baleanu derivatives. AIMS Mathematics, 2023, 8(11): 25863-25887. doi: 10.3934/math.20231319
    [5] Xiaoyong Xu, Fengying Zhou . Orthonormal Euler wavelets method for time-fractional Cattaneo equation with Caputo-Fabrizio derivative. AIMS Mathematics, 2023, 8(2): 2736-2762. doi: 10.3934/math.2023144
    [6] Rahat Zarin, Abdur Raouf, Amir Khan, Aeshah A. Raezah, Usa Wannasingha Humphries . Computational modeling of financial crime population dynamics under different fractional operators. AIMS Mathematics, 2023, 8(9): 20755-20789. doi: 10.3934/math.20231058
    [7] Ricardo Almeida . Variational problems of variable fractional order involving arbitrary kernels. AIMS Mathematics, 2022, 7(10): 18690-18707. doi: 10.3934/math.20221028
    [8] Fawaz K. Alalhareth, Seham M. Al-Mekhlafi, Ahmed Boudaoui, Noura Laksaci, Mohammed H. Alharbi . Numerical treatment for a novel crossover mathematical model of the COVID-19 epidemic. AIMS Mathematics, 2024, 9(3): 5376-5393. doi: 10.3934/math.2024259
    [9] Shazia Sadiq, Mujeeb ur Rehman . Solution of fractional boundary value problems by ψ-shifted operational matrices. AIMS Mathematics, 2022, 7(4): 6669-6693. doi: 10.3934/math.2022372
    [10] Iqbal M. Batiha, Abeer A. Al-Nana, Ramzi B. Albadarneh, Adel Ouannas, Ahmad Al-Khasawneh, Shaher Momani . Fractional-order coronavirus models with vaccination strategies impacted on Saudi Arabia's infections. AIMS Mathematics, 2022, 7(7): 12842-12858. doi: 10.3934/math.2022711
  • The fuzzy reinstatement labelling (FRL) puts forward a reasonable method to rewind the acceptable degrees of arguments in fuzzy argumentation frameworks. The fuzzy labelling algorithm (FLAlg) computes the FRL by infinitely approximating the limits of an iteration sequence. However, the FLAlg is unable to provide an exact FRL, and its computation complexity depends on not only the number of arguments but also the accuracy. This brings a quick increase in complexity when higher accuracy is acquired. In this paper, through the in-depth study of the FLAlg, we introduce an effective algorithm for decomposing FRL by strongly connected components. For simple fuzzy frameworks in the form of trees, odd cycles, and even cycles, the new algorithm provides an exact value of the limit. Therefore, by avoiding the infinite approximation process, it is independent of accuracy. And for complex frames, the new algorithm outputs an approximate value to the FLAlg. It is more efficient because the number of arguments in the approximation process is usually reduced.



    Fractional calculus (FC) is not a new research area; in reality, it has almost the same history as classical calculus. It motivates the study of derivatives and integrals of fractional order (FO). The history of FC was started in 1695 and appreciated during last few decades, when L'Hopital's question to Leibniz about the differentiation of d12dx(x) [1]. For this, at that time, dated 30 September 1695, Leibniz responded to L'Hopital that "This is an apparent Paradox from which, one day, useful consequences will be drawn" and that was the birth of FC. After that, this concept of fractional differentiation, fractional integration, and its application has found in many numerous areas of the research field of sciences and engineering, especially in control engineering, electromagnetism, signal processing, fluid mechanics, diffusion process, biosciences, statistical, and continuum mechanics and many more. Also, from time to time, FC has been generalized by many researchers and mathematicians, namely Euler, Laplace, Lagrange, Fourier, Riemann, and many others. The differentiation of FO β>0 has various definitions. But Riemann Liouville (RL) derivative and Caputo's derivative are the old and most commonly used. The CFD is used for our work as it has some advantage in dealing with the IVP of fractional differential equation of non-integer order β>0. Also, many authors [2,3] have given the existence and uniqueness conditions of the IVP for FDEs.

    In the study, it has been found that most of the IVP of FDEs don't have an exact scheme to find the solution, especially for non-linear FDEs. So, it becomes a challenging situation for researchers to establish some methods for finding the analytical solutions of FDEs. Therefore, many researchers have suggested several methods numerically for extended approximate solutions of integer differential equations into fractional differential equations. These schemes incorporates: fractional differential transform scheme, Adomain decomposition scheme [4], variational iteration method [5], spectral collocation scheme [6], fractional finite difference scheme [7], fractional Adams scheme [8], homotopy perturbation scheme [9], homotopy analysis scheme [10], extrapolation method [11], and many others.

    In current decades, the IVP of FDEs used as a weapon to solve the various mathematical models, the epidemic model, the disease model, the dynamical system model, and many others. In recent times, Tong et al. [12] proposed fractional EM and fractional IEM, which are the generalization of classical EM and IEM for first-order IVP of FDEs. That EM has a linear convergence rate while IEM has a quadratic convergence rate. In [13] (Chapter 06), C. Milici et al. study several numerical methods for FO systems. In which, they proposed variational iteration, least squares, Euler's, and Runge-Kutta methods for the system of FDE in the CFD sense. In [14], Kumar et al. suggested a numerical scheme to demonstrate the numerical behavior of the IVP of FDEs in which one of the methods is midpoint point whose convergence rate is quadratic. In [15], Muhammad et al. developed a two-stage generalized Rk2 scheme of second order in the CFD sense. These all referred works motivate us to establish more accurate schemes to solve the IVP of FDE in the CFD sense. Also, our objective is to show, based on a few concrete examples and a few application models, that FDEs can model the physical problem more effectively than ODEs. Recently, many research article has been found that solve the real-world phenomenon in FDEs [16,17,18]. This work proposes a fractional RCM scheme for IVP of linear and non-linear FDEs of order β[0,1]. This scheme has a cubic convergence rate. It is the generalization of classical RCM, developed by Anthony Ralston [19,20]. This proposed scheme has a more accurate approximation compared to existing fractional EM, IEM, Midpoint method (MPM), and many others for the IVP of FDE:

    CDβx+0u=g(x,u),withinitialconditionu(x0)=u0,andx(x0,xEnd]. (1.1)

    Here, CDβx+0 indicates the CFD of arbitrary order β where β[0,1].

    By using the proposed work, our main goal is to establish a novel study which is more accurate and appropriate in order to derive the approximate solution of IVP of FDEs (1.1). This scheme incorporates the algorithm, order of convergence, stability, and few numerical examples including the application to WPG model. The scheme also recognize as a type of Runge-Kutta third order method (RK3) and this is explicitly familiar with the term \enquote{One-Step} method.

    The presentation of the paper is designed as follows. In Section 2, we provide some preliminary definitions and properties of fractional derivatives and integrals. Next, in Section 3, we suggest our methodology briefly and its order of convergence by following some essential lemma and theorem. Then, in Section 4, we establish the stability of the concerned scheme. After that, in Section 5, we implemented the proposed method on a few examples of linear and nonlinear IVP of FDEs in the CFD frame. In Section 6, we solved World Population Growth (WPG) model via the suggested scheme with the comparison of EM and IEM. Finally, in Section 7, we conclude our methodology with some essential annotations.

    This section focuses on some basic definitions of fractional derivatives and integrals, properties, and valuable results in the RL and Caputo derivative sense. This section will be helpful in our this advancement work as this will arise the generalization of ordinary calculus [21,22,23,24,25].

    Definition 2.1. [26] The FO integral in the sense of RL derivative for the function κ:[a,b]R of arbitrary order β>0 are

    Jβa+κ(ζ)=1Γ(β)ζaκ(p)(ζp)1βdp,ζ>a,andJβbκ(ζ)=1Γ(β)bζκ(p)(pζ)1βdp,ζ<b,

    called the left and right RL fractional integral respectively. Here Γ(β) denotes the Euler's Gamma function.

    Definition 2.2. [26,27] The FO derivatives in the RL sense for the function κ:[a,b]R of order β>0 are

    RLDβa+κ(ζ)=1Γ(nβ)dndζnζa(ζp)nβ1κ(p)dp,ζ>a,andRLDβbκ(ζ)=(1)nΓ(nβ)dndζnbζ(pζ)nβ1κ(p)dp,ζ<b,

    called the left and right RL fractional derivative respectively, where n=1+[β] and [β] indicate the integral part of β. Particularly, if we take 0<β<1, then

    RLDβa+κ(ζ)=1Γ(1β)ddζζa(ζp)βκ(p)dp,ζ>a,andRLDβbκ(ζ)=1Γ(1β)ddζbζ(pζ)βκ(p)dp,ζ<b,

    are called the left and right RL derivatives of order β, where 0<β<1.

    Definition 2.3. [26] The FO derivatives in the Caputo sense for the function κ:[a,b]R of order β>0 are

    CDβa+κ(ζ)=1Γ(nβ)ζa(ζp)nβ1κ(n)(p)dp,ζ>a,andCDβbκ(ζ)=(1)nΓ(nβ)bζ(pζ)nβ1κ(n)(p)dp,ζ<b,

    called the left and right Caputo derivative respectively, where n=1+[β].

    Particularly, if we take 0<β<1, then

    CDβa+κ(ζ)=1Γ(1β)ζa(ζp)βκ(p)dp,ζ>a,andCDβbκ(ζ)=1Γ(1β)bζ(pζ)βκ(p)dp,ζ<b,

    are called the left and right FO Caputo derivatives of order β, where 0<β<1.

    The relation between the FO derivative in Caputo fractional derivative and Riemann-Liouville fractional derivative is

    CDβa+κ(ζ)=RLDβa+κ(ζ)n1k=0κk(a)(ζa)kβΓ(kβ+1),andCDβbκ(ζ)=RLDβbκ(ζ)n1k=0κk(b)(bζ)kβΓ(kβ+1),

    where n=1+[β].

    Definition 2.4. [26] The one and two parameter Mittag-Leffler function are defined by,

    Eβ(ζ)=n=0ζnΓ(βn+1),β,ζC;Re(β)>0,andEβ,γ(ζ)=n=0ζnΓ(βn+γ),β,γ,ζC;Re(β),Re(γ)>0,

    respectively. If βC with Re(β)>0, then the series Eβ(ζ) is convergent for all ζC. Similarly, if β,γC with Re(β),Re(γ)>0, then the series Eβ,γ(ζ) is convergent for all ζC.

    Lemma 2.1. [26] If β, γ0, and ΦL1[a,b], then

    Jβa+Jγa+Φ=Jβ+γa+Φ,JβbJγbΦ=Jβ+γbΦ,

    holds everywhere on the interval [a,b]. If Φ(x)C[a,b] or 1β+γ, then identity holds everywhere on the interval [a,b].

    Lemma 2.2. [28] If ΦCn[a,b], a<b and nN. Moreover, If β1,β2>0 be such that, some kN with kn and β1, β1+β2[k1,k]. Then,

    CDβ1a+CDβ2a+Φ=CDβ1+β2a+Φ.

    Theorem 2.1. (Existence of IVP of FDE) [12] Let g(x,u) be a function that hold the condition g(x0,u(x0))=0 and also the g(x,u) is continuous on the domain R:0xx0d, |uu0|e, then the FDEs:

    CDβx+0u=g(x,u),withthecondition,u(a)=u0andx(x0,xEnd], (2.1)

    has at least one solution in the interval 0xx0λ with λ=min{d,eM} and max(x,u)RCD1βx+0g(x,u)<M.

    Theorem 2.2. (Uniqueness of IVP of FDE) [12] Under the hypotheses of Theorem 2.1, and if gx(x,u) holds the Lipschitz condition in the variable u with Lipschitz constant 0<L,

    |gx(x,u1)gx(x,u2)|L|u1u2|,

    then the FDEs (2.1) have an unique solution.

    In our work, we are concerned about the approximate solution of the IVP for the linear and non-linear FDEs:

    CDβx+0u=g(x,u),withinitialconditionu(x0)=u0,andx(x0,xEnd]. (3.1)

    Here, we assume the derivative is in the CFD sense of FO β where β[0,1]. Now, with the help of Lemma 2.2, we apply suitable analogous transformation so that it becomes the classical differential equation. Then, we get the CFD of order (1β) and the revised IVP of FDEs:

    u=CD1βx+0g(x,u),withinitialconditionu(x0)=u0,andx(x0,xEnd]. (3.2)

    Now, to discover the accurate numerical scheme to find the solution of the IVP of FDEs (3.1) is equivalent to locating the accurate numerical scheme for the IVP of FDEs (3.2). For such a precise solution of (3.2), we designed the RCM in fractional derivative operator, which we rename as fractional RCM, and it is more accurate and faster than all other linear and quadratic convergence rates like EM and IEM [12]. Below, we describe the fractional RCM.

    For obtaining the approximate solution of FDE (3.2), we consider (xk,uk) be the set points and we make this points accordingly so that the mesh are equally distribute in the whole interval [a,b] where we set x0=a and xEnd=b. This idea will be good by selecting an integer which is non-negative say N and assuming the mesh points. So, By following RCM, we construct the following algorithm:

    {xk=x0+kh,fork=0,1,2,,Nh=xk+1xk,uk+1=uk+h9(2l1+2l2+4l3),l1=CD1βx+0g(x,uk)|x=xk,l2=CD1βx+0g(x+h2,uk+h2l1)|x=xk,l3=CD1βx+0g(x+3h4,uk+3h4l2)|x=xk.

    Also with the use of Matlab, the RCM algorithm is proven to be an effective and much more accurate compared to linear and quadratic schemes.

    Before showing the convergence of our suggested methodology, first we establish few relevant results which will be essential in the establishment of the convergence of the methods.

    Lemma 3.1. [12] If gx(x,u) be a function that hold the condition of Lipschitz in the variable of u, for some Lipschitz constant L>0,

    |gx(x,u1)gx(x,u2)|L|u1u2|,

    and also fulfil the conditions of Theorem 2.1, then G(x,u)=CD1βx+0g(x,u) also holds the condition of Lipschitz in the of variable u, for some another Lipschitz constant M>0,

    |G(x,u1)G(x,u2)|M|u1u2|.

    Lemma 3.2. If the function G(x,y) follows the condition of Lipschitz for the variable u and also satisfies the condition of Theorem 2.1, then

    τ(x,u)=29G(x,u)+13G(x+h2,u+h2G(x,u))+49G(x+3h4,u+3h4G(x+3h4,u+3h4G(x+h2,u+h2G(x,u)))), (3.3)

    also satisfies the condition of Lipschitz in the variable of u.

    Proof.

    |τ(x,u1)τ(x,u2)|29|G(x,u1)G(x,u2)|+13|G(x+h2,u1+h2G(x,u1))G(x+h2,u2+h2G(x,u2))|+49|G(x+3h4,u1+3h4G(x+h2,u1+h2G(x,y)))G(x+3h4,u2+3h4G(x+h2,u2+h2G(x,y)))|M|u1u2|+hM22|u1u2|+h2M36|u1u2|=M(1+hM2!+h2M23!)|u1u2|=Lτ|u1u2|,

    So, |τ(x,u1)τ(x,u2)|Lτ|u1u2|, where Lτ=M(1+hM2!+h2M23!).

    Theorem 3.1. Consider gx(x,u) be the function that holds the condition of Lipschitz in the variable of u with Lipschitz constant L>0,

    |gx(x,u1)gx(x,u2)|L|u1u2|,

    and u(x) be the unique solution of IVP of FDEs (3.2).

    Let uk be the generated solution approximation by Ralston's Cubic method for some non-negative integer N. Then for each k=0,1,2,N,

    u(xk)uk=O(h3).

    Proof. Let us take RCM iterative formula which is based on uk=u(xk), then we get

    ˉuk+1=u(xk)+h9[2CD1βx+0g(x,uk)|x=xk+3CD1βx+0g(x+h2,uk+h2CD1βx+0g(x,uk)|x=xk)|x=xk4CD1βx+0g(x+3h4,uk+3h4CD1βx+0g(x+h2,uk+h2CD1βx+0g(x,uk)|x=xk)|x=xk)|x=xk].

    Assuming, G(x,u)=CD1βx+0g(x,u), then

    ˉuk+1=u(xk)+h9[2G(xk,uk)+3G(xk+h2,uk+h2u(xk))+4G(xk+3h4,uk+3h4G(xk+h2,uk+h2u(xk)))]=u(xk)+2h9G(xk,uk)+h3[G(xk,uk)+(h2Gx(xk,uk)+h2Gu(xk,uk)u(xk))+12!((h2)2Gxx(xk,uk)+h22u(xk)Gxu(xk,uk)+(h2)2(u(xk))2Guu(xk,uk))+O(h3)]+4h9[G(xk,uk)+(3h4Gx(xk,uk)+3h4(G(xk,uk)+h2Gx(xk,uk)+h2u(xk)Gu(xk,uk))Gu(xk,uk))+12!(3h4)2(Gxx(xk,uk)+2Gxu(xk,uk)(G(xk,uk)+O(h))+Guu(xk,uk)(G(xk,uk)+O(h))2)+13!(3h4)3(Gxxx(ξ,η)+3(G(xk,uk)+O(h))Gxxu(ξ,η)+3(G(xk,uk)+O(h))2Gxuu(ξ,η)+(G(xk,uk)+O(h))3Guuu(ξ,η))]=u(xk)+hu(xk)+h22[Gx(xk,uk)+u(xk)Gu(xk,uk)]+h33![Gxx(xk,uk)+2u(xk)Gxu(xk,uk)+Guu(xk,uk)(u(xk))2+Gx(xk,uk)Gy(xk,uk)+u(xk)(Gu(xk,uk))2]+O(h4)=u(xk)+hu(xk)+h22u(xk)+h33!u(xk)+O(h4). (3.4)

    By using the Taylor's series, the exact form of the solution will be:

    u(xk+1)=u(xk)+hu(xk)+h22!u(xk)+h33!u(xk)+h44!u(xk)+ (3.5)

    Now, from the expression (3.4) and (3.5), we obtained |u(xk+1)ˉuk+1|=O(h4). So, we get

    |u(xk+1)ˉuk+1|Kh4.

    Let us assume that,

    τ=29G(x,u)+13G(x+h2,u+h2G(x,u))+49G(x+3h4,u+3h4G(x+3h4,u+3h4G(x+h2,u+h2G(x,u)))),

    then using the stated Lemmas 3.1 and 3.2, we have

    |ˉuk+1uk+1||u(xk)uk|+h|τ(xk,u(xk))τ(xk,uk)|(1+hLτ)|u(xk)uk|.

    Now,

    |u(xk+1)uk+1||u(xk+1)ˉuk+1|+|ˉuk+1uk+1|Kh4+(1+hLτ)|u(xk)uk|.

    So, we get the estimation, |Ek+1|=(1+hLτ)|Ek|+Kh4.

    Thus, we get the recursion relation,

    |Ek|(1+hLτ)k|E0|+Kh3Lτ[(1+hLτ)k1].

    As, xkx0=khandE0=0then,(1+hLτ)kekhLτ=ϕτ.

    So, we have |Ek|Kh3Lτ(ϕτ1).

    Therefore, |u(xk)uk|=O(h3).

    This conclude that RCM has a cubic convergence rate.

    In this section, let us look at the numerical stability of our proposed scheme. Consider the IVP of FDE 3.2 in the simplest form by assuming G(x,u)=CD1βx+0g(x,u) as,

    u=G(x,u),withinitialconditionu(x0)=u0,andx[x0,xEnd]. (4.1)

    The numerical solution of the RCM scheme is given by the formula:

    {uk+1=uk+h9(2l1+2l2+4l3),l1=G(xk,uk),l2=G(xk+h2,uk+h2l1),l3=G(xk+3h4,uk+3h4l2).

    In the simplest form, the concept of absolute stability [29,30] is based on the analysis of the behavior, according to the values of the step h, of the numerical solutions of the model equation:

    u(x)=μu.

    The linearized equation uses G(x,u)=μu. In this case,

    l1=μuk,l2=μ(1+μh2)uk,l3=μ(1+3μh4(1+μh2))uk.

    These combine to form,

    uk+1=[1+(hμ)+(hμ)22+(hμ)36]uk=ξ(hμ)uk.

    Let us put hμ=z, then the absolute stability region is the set

    {zC:|ξ(hμ)|1}.

    Let us examine the stability region of the numerical scheme RCM. Here, the stability region is the set of points such that |ξ(hμ)|1, which is shown in the Figure 1. Note that for stability, the choice of h must guarantee that |hμ| is inside the region. Furthermore, the real parts must be nonnegative for stability (or marginal stability). Therefore the regions to the left of the imaginary axis are the only ones of relevance.

    Figure 1.  Stability region for RCM.

    In this section, we illustrate how our proposed scheme operates in practice. We consider few examples of linear as well as non-linear IVP for FDEs in CFD form and solved numerically using the RCM scheme. First we compare the numerical solution with the analytical ones and then compare with the existing EM and IEM schemes. All the numerical computation have been carried out in MATLAB R2016a version. Now, before proceeding of numerical examples, we define few terminology.

    The absolute error used in the table is defined as, eN=maxjZ|u(xj)uN(xj)|. The used estimated oder of convergence (EOC) is defined by the quantity as,

    EOC=log2uuNuu2N,

    where uN and u2N are the approximate solution at two distinct grids, with step length h and h2, respectively.

    In this subsection, we consider four examples of fractional IVPs of FDEs. In these four examples, the Examples 5.1 and 5.2 are linear, Examples 5.3 and 5.4 are non-linear. Here, we consider in Examples 5.1–5.3, the FDE has exact solution and Example 5.4, the FDE has no exact solution. These all FDEs are solved using the proposed fractional RCM including the proper comparison with the existing fractional EM and IEM.

    Example 5.1. Consider the following fractional linear initial value problem (IVP) of FDE:

    CDβ0+u=x3,0<x1,u(0)=0. (5.1)

    For β=12, the exact solution of (5.1) is,

    u(x)=Γ(4)Γ(4.5)x3.5.

    Using our suggested scheme for β=12 and with step length h=110, the numerical solution of (5.1) are graphically represented in the Figure 2 and their exact solution, approximate solution are illustrated in the Table 1. Together with this, the absolute error visualization is indicated in Figure 3. The EOC and CPU performance of the schemes is tabulated in Table 2, and its plot is illustrated in Figure 4.

    Figure 2.  Exact and numerical solutions of Example 5.1.
    Table 1.  Numerical solutions of Example 5.1 when β=12 with step length h=110.
    EM IEM RCM
    x uexact uEM |uexactuEM| uIEM |uexactuIEM| uRCM |uexactuRCM|
    0.00 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000
    0.10 0.000163 0.000000 0.000163 0.000285 0.000122 0.000157 0.000006
    0.20 0.001845 0.000571 0.001275 0.002186 0.000340 0.001837 0.000009
    0.30 0.007628 0.003801 0.003828 0.008250 0.000622 0.007617 0.000011
    0.40 0.020879 0.012700 0.008179 0.021835 0.000956 0.020866 0.000013
    0.50 0.045593 0.030970 0.014624 0.046927 0.001334 0.045578 0.000015
    0.60 0.086305 0.062885 0.023420 0.088057 0.001752 0.086288 0.000017
    0.70 0.148030 0.113230 0.034800 0.150237 0.002207 0.148012 0.000018
    0.80 0.236223 0.187245 0.048978 0.238919 0.002696 0.236203 0.000020
    0.90 0.356743 0.290592 0.066151 0.359959 0.003216 0.356722 0.000021
    1.00 0.515830 0.429326 0.086505 0.519596 0.003766 0.515808 0.000022

     | Show Table
    DownLoad: CSV
    Figure 3.  Absolute error visualization of Example 5.1.
    Table 2.  EOC with CPU time of Example 5.1.
    EM IEM RCM
    n Error EOC CPU(sec) Error EOC CPU(sec) Error EOC CPU(sec)
    10 0.08650 --- 0.00005 0.00377 --- 0.00006 0.00002 --- 0.00008
    20 0.04419 0.96891 0.00011 0.00094 2.00107 0.00024 0.00000 2.97066 0.00032
    40 0.02233 0.98472 0.00029 0.00024 2.00039 0.00067 0.00000 2.97987 0.00100
    80 0.01123 0.99242 0.00006 0.00034 2.00014 0.00068 0.00000 2.98607 0.00115
    160 0.00563 0.99623 0.00117 0.00001 2.00005 0.00194 0.00000 2.99030 0.00284
    320 0.00282 0.99812 0.00244 0.00000 2.00002 0.00469 0.00000 2.99321 0.00578
    640 0.00141 0.99906 0.00490 0.00000 2.00001 0.01049 0.00000 2.99524 0.01400
    1280 0.00071 0.99953 0.00862 0.00000 2.00000 0.01811 0.00000 2.99664 0.02656
    2560 0.00035 0.99977 0.01213 0.00000 2.00000 0.02224 0.00000 2.99744 0.04221

     | Show Table
    DownLoad: CSV
    Figure 4.  Order of convergence plot of Example 5.1.

    In the Figure 2, it represents the comparison between the exact and numerical result of our proposed scheme RCM with EM and IEM. Table 1 indicates the exact value, approximate value and absolute error of EM, IEM, and our proposed scheme RCM in which we observe that the numerical solution of RCM are more accurate to the exact solution. Figure 3 represents the absolute error of EM, IEM and our proposed scheme RCM, in which we notice that RCM has minimum absolute error in the comparison of EM and IEM, while IEM has second order of convergence. The order of convergence of our suggested scheme RCM, EM, IEM is tabulated in the Table 2 and graphically shown in the Figure 4. From there, it is clear that the order of EM is linear, the order of IEM is quadratic and the order of RCM is cubic. So, RCM is better than the EM and IEM. Next, in the Figure 4, the blue line indicates the linear convergence of EM, the magenta line indicates the quadratic convergence of IEM, and the green line indicates the cubic convergence of RCM respectively.

    From our stated Example 5.1, the conclusion is that RCM is much more accurate in the comparison of the EM and IEM. Similar conclusion can also be drawn in the Examples 5.2 and 5.3.

    Example 5.2. Consider the following linear IVP of FDE [31]:

    CDβ0+u=u,0.1<x1,u(0.1)=Eβ((0.1)β). (5.2)

    For β=12, the exact solution of (5.2) is,

    u(x)=Eβ(xβ).

    Using our suggested scheme for β=12 and with step length h=110, the numerical solution of (5.2) are graphically represented in the Figure 5 and their exact solution, approximate solution are illustrated in the Table 3. Together with this, the absolute error visualization is indicated in Figure 6. The EOC and CPU performance of the schemes is tabulated in Table 4, and its plot is illustrated in Figure 7.

    Figure 5.  Exact and numerical solutions of Example 5.2.
    Table 3.  Numerical solutions of Example 5.2, when β=12, with step length h=110.
    EM IEM RCM
    x uexact uEM |uexactuEM| uIEM |uexactuIEM| uRCM |uexactuRCM|
    0.10 1.486763 1.486763 0.000000 1.486763 0.000000 1.486763 0.000000
    0.20 1.799017 1.813852 0.014835 1.803337 0.004320 1.799343 0.000326
    0.30 2.107699 2.119910 0.012211 2.113254 0.005555 2.108071 0.000372
    0.40 2.430043 2.433687 0.003644 2.436248 0.006205 2.430428 0.000385
    0.50 2.774286 2.765897 0.008389 2.780962 0.006676 2.774675 0.000389
    0.60 3.146213 3.123114 0.023099 3.153299 0.007086 3.146603 0.000390
    0.70 3.550803 3.510572 0.040230 3.558285 0.007482 3.551193 0.000390
    0.80 3.992836 3.933086 0.059750 4.000723 0.007887 3.993226 0.000390
    0.90 4.477185 4.395448 0.081737 4.485498 0.008313 4.477573 0.000389
    1.00 5.008980 4.902637 0.106343 5.017751 0.008771 5.009367 0.000387

     | Show Table
    DownLoad: CSV
    Figure 6.  Absolute error visualization of example 5.2.
    Table 4.  EOC with CPU time of Example 5.2.
    EM IEM RCM
    n Error EOC CPU(sec) Error EOC CPU(sec) Error EOC CPU(sec)
    10 0.09645 --- 0.00006 0.00715 --- 0.00007 0.00029 --- 0.00010
    20 0.04997 0.94871 0.00012 0.00183 1.96664 0.00016 0.00004 2.89943 0.00022
    40 0.02544 0.97401 0.00028 0.00046 1.99007 0.00031 0.00000 2.98186 0.00054
    80 0.01284 0.98703 0.00033 0.00012 1.99737 0.00059 0.00000 3.00258 0.00090
    160 0.00645 0.99354 0.00064 0.00003 1.99933 0.00181 0.00000 3.00457 0.00370
    320 0.00323 0.99678 0.00229 0.00001 1.99983 0.00451 0.00000 3.00313 0.00711
    640 0.00162 0.99839 0.00238 0.00000 1.99996 0.00505 0.00000 3.00178 0.01928
    1280 0.00081 0.99920 0.00589 0.00000 1.99999 0.00680 0.00000 3.00095 0.02912
    2560 0.00040 0.99960 0.00682 0.00000 2.00000 0.01662 0.00000 3.00009 0.04033

     | Show Table
    DownLoad: CSV
    Figure 7.  Order of convergence plot for Example 5.2.

    Example 5.3. Consider the following non-linear IVP of FDE:

    CDβ1+u=(35π32)u67,1<x2,u(1)=1. (5.3)

    For β=12, the exact solution of (5.3) is,

    u(x)=x3.5.

    Using our suggested scheme for β=12 and with step length h=110, the numerical solution of (5.3) are graphically represented in the Figure 8 and their exact solution, approximate solution are illustrated in the Table 5. Together with this, the absolute error visualization is indicated in Figure 9. The EOC and CPU performance of the schemes is tabulated in Table 6, and its plot is illustrated in Figure 10.

    Figure 8.  Exact and numerical solutions of Example 5.3.
    Table 5.  Numerical solutions of Example 5.3, when β=12, with step length h=110.
    EM IEM RCM
    x uexact uEM |uexactuEM| uIEM |uexactuIEM| uRCM |uexactuRCM|
    1.00 1.000000 1.000000 0.000000 1.000000 0.000000 1.000000 0.000000
    1.10 1.395965 1.350000 0.045965 1.391837 0.004127 1.395743 0.000221
    1.20 1.892929 1.783674 0.109255 1.883452 0.009478 1.892442 0.000488
    1.30 2.504965 2.312825 0.192141 2.488830 0.016135 2.504165 0.000800
    1.40 3.246745 2.949869 0.296875 3.222565 0.024180 3.245583 0.001161
    1.50 4.133514 3.707821 0.425693 4.099827 0.033687 4.131942 0.001571
    1.60 5.181076 4.600266 0.580810 5.136346 0.044730 5.179043 0.002033
    1.70 6.405768 5.641347 0.764422 6.348392 0.057377 6.403222 0.002546
    1.80 7.824449 6.845745 0.978704 7.752755 0.071694 7.821336 0.003113
    1.90 9.454479 8.228665 1.225814 9.366733 0.087746 9.450744 0.003735
    2.00 11.313708 9.805821 1.507887 11.208114 0.105594 11.309296 0.004413

     | Show Table
    DownLoad: CSV
    Figure 9.  Absolute error visualization of Example 5.3.
    Table 6.  EOC with CPU time of Example 5.3.
    EM IEM RCM
    n Error EOC CPU(sec) Error EOC CPU(sec) Error EOC CPU(sec)
    10 1.50789 --- 0.00006 0.10559 --- 0.00007 0.00441 --- 0.00011
    20 0.80303 0.90901 0.00027 0.02854 1.88746 0.00045 0.00059 2.89185 0.00064
    40 0.41481 0.95299 0.00046 0.00743 1.94236 0.00091 0.00008 2.94618 0.00117
    80 0.21087 0.97610 0.00074 0.00189 1.97081 0.00093 0.00001 2.97319 0.00251
    160 0.10632 0.98795 0.00109 0.00048 1.98531 0.00465 0.00000 2.98662 0.00889
    320 0.05338 0.99395 0.00326 0.00012 1.99263 0.00564 0.00000 2.99332 0.00976
    640 0.02675 0.99697 0.00729 0.00003 1.99631 0.01485 0.00000 2.99666 0.02247
    1280 0.01339 0.99848 0.01173 0.00001 1.99815 0.03425 0.00000 2.99833 0.03725
    2560 0.00670 0.99924 0.02115 0.00000 1.99908 0.03590 0.00000 2.99907 0.04107

     | Show Table
    DownLoad: CSV
    Figure 10.  Order plot for Example 5.3.

    Example 5.4. Consider the following IVP of FDE:

    CDβ0+u=e2x,0<x1,u(0)=1. (5.4)

    With the help of our suggested scheme for β=110 and with step length h=110 and h=120, the numerical solution of (5.4) is graphically shown in the Figure 11 and their approximate solutions for h=120 is illustrated in the Table 7. In this example, the absolute error is calculated as the difference between the approximate solution at N grid point and 2N grid point. The absolute error visualization is indicated in Figure 12 for h=120. The EOC and CPU performance of the schemes is tabulated in Table 8, and its plot is illustrated in Figure 13 for h=120.

    Figure 11.  Numerical solutions of Example 5.4 for h=110 and h=120, (β=110).
    Table 7.  Numerical solutions of Example 4 when β=110, with step length h=120.} \addtolength{\tabcolsep}{-4pt.
    EM IEM RCM
    x uEM |uEM(h)uEM(h2)| uIEM |uIEM(h)uIEM(h2)| uRCM |uRCM(h)uRCM(h2)|
    0.00 1.000000 0.000000 1.000000 0.000000 1.000000 0.000000
    0.10 1.196419 0.005035 1.206748 0.000129 1.206575 0.000001
    0.20 1.436327 0.011185 1.459271 0.000287 1.458887 0.000001
    0.30 1.729350 0.018697 1.767703 0.000479 1.767061 0.000002
    0.40 2.087249 0.027872 2.144423 0.000715 2.143466 0.000003
    0.50 2.524389 0.039079 2.604549 0.001002 2.603208 0.000005
    0.60 3.058312 0.052766 3.166549 0.001353 3.164738 0.000007
    0.70 3.710447 0.069484 3.852977 0.001781 3.850593 0.000009
    0.80 4.506967 0.089903 4.691383 0.002305 4.688297 0.000011
    0.90 5.479839 0.114843 5.715413 0.002944 5.711471 0.000014
    1.00 6.668107 0.145305 6.966167 0.003725 6.961180 0.000018

     | Show Table
    DownLoad: CSV
    Figure 12.  Absolute error visualization of Example 5.4 at h=120 with the use of h=110.
    Table 8.  EOC with CPU time of Example 4.
    EM IEM RCM
    n Error EOC CPU(sec) Error EOC CPU(sec) Error EOC CPU(sec)
    10 0.28317 --- 0.00003 0.01489 --- 0.00004 0.00014 --- 0.00005
    20 0.14531 0.96258 0.00007 0.00372 1.99910 0.00007 0.00002 2.99292 0.00010
    40 0.07358 0.98163 0.00011 0.00093 1.99977 0.00012 0.00000 2.99678 0.00019
    80 0.03702 0.99090 0.00017 0.00023 1.99994 0.00024 0.00000 2.99847 0.00065
    160 0.01857 0.99547 0.00028 0.00006 1.99999 0.00049 0.00000 2.99926 0.00075
    320 0.00930 0.99774 0.00034 0.00001 2.00000 0.00063 0.00000 2.99963 0.00096
    640 0.00465 0.99887 0.00104 0.00000 2.00000 0.00164 0.00000 2.99984 0.00190
    1280 0.00233 0.99944 0.00129 0.00000 2.00000 0.00292 0.00000 2.99947 0.00471
    2560 0.00116 0.99972 0.00334 0.00000 2.00000 0.00724 0.00000 3.00440 0.01124

     | Show Table
    DownLoad: CSV
    Figure 13.  Order plot for Example 5.4.

    In this section, we consider one application of the real-world phenomenon WPG model in the form of CFD. We solve the model numerically using our proposed scheme. Also, we discuss the benefits of FC using the WPG model.

    Example 6.1. Consider the following linear IVP of FDE of WPG model [32],

    CDβt+0N(t)=PN(t),t>t0, (6.1)
    N(t0)=N0. (6.2)

    Here N(t) suggest the number of individuals population at any time t and here our P represents the production rate where P=BM, B indicates the rate of birth, and M indicates the rate of mortality. Now, if we assume the value of β=1 then in this case, our corresponding model will be linear population world growth model which is also famous as a classical population world growth model. The exact solution of (6.1) for β=1 is,

    N(t)=N0ePt,t>0.

    Where N0 indicates the initial population at the initial time t=t0. Our fractional model is better than the classical model from the numerical perspective. We have taken the population database from the year 1920 to 2018, that is around one century from the world population sites https://www.census.gov/data/tables/time-series/demo/international-programs/historical-est-worldpop.html or https://datacommons.org/place/Earth (provided by world bank), and also one is taken by United Nations [33]. These statistical population data match our fractional model scheme for β=1.393298754843208. Also, The exact solution of (6.1) for the fractional model of population world growth model will be,

    N(t)=N0Eβ(Pt),t>0.

    Now, in our classical population model scheme, the estimated value of our production rate is P0.013501 and for the fractional model scheme, the production rate P0.0034399 [34]. So, it has been found that the statistical population date value fit with the our fractional model for β=1.3932987548432.

    The world population data from the year 1920 to 2018 is graphically represented in the Figure 14 and the numerical value of (6.1) for β=1 and β=1.393298754843 with the step size h=1 year is graphically shown in the Figure 15, tabulated in the Table 9. In addition to this, the absolute error visualization represented in Figure 16. From all the tables and figures, we conclude that our suggested scheme RCM is much more accurate and faster than EM and IEM.

    Figure 14.  Population data from 1920 to 2018.
    Figure 15.  Exact and numerical solutions of Example 5.5.
    Table 9.  Numerical solution of Example 5 when β=1, β=1.3932987548432, with h=1 year.} \addtolength{\tabcolsep}{-5pt.
    EM IEM RCM
    Year(t) Nclasical Nfrac NEM Error NIEM Error NRCM Error
    1920 1.8600×103 1.8600×103 1.8600×103 0.0000×100 1.8600×103 0.0000×100 1.8600×103 0.0000×100
    1930 2.1289×103 1.9909×103 1.9799×103 1.1060×101 1.9892×103 1.7315×100 1.9904×103 4.8870×101
    1940 2.4366×103 2.2169×103 2.2020×103 1.4921×101 2.2152×103 1.7413×100 2.2164×103 4.8880×101
    1950 2.7888×103 2.5173×103 2.4987×103 1.8625×101 2.5156×103 1.7390×100 2.5168×103 4.8882×101
    1960 3.1919×103 2.8943×103 2.8717×103 2.2615×101 2.8926×103 1.7320×100 2.8938×103 4.8884×101
    1970 3.6533×103 3.3561×103 3.3290×103 2.7117×101 3.3544×103 1.7219×100 3.3556×103 4.8885×101
    1980 4.1814×103 3.9147×103 3.8824×103 3.2308×101 3.9130×103 1.7090×100 3.9142×103 4.8886×101
    1990 4.7858×103 4.5858×103 4.5474×103 3.8363×101 4.5841×103 1.6930×100 4.5853×103 4.8888×101
    2000 5.4775×103 5.3885×103 5.3431×103 4.5471×101 5.3869×103 1.6737×100 5.3881×103 4.8889×101
    2010 6.2693×103 6.3462×103 6.2923×103 5.3847×101 6.3445×103 1.6505×100 6.3457×103 4.8891×101
    2020 7.1755×103 7.4865×103 7.4228×103 6.3739×101 7.4849×103 1.6229×100 7.4860×103 4.8893×101

     | Show Table
    DownLoad: CSV
    Figure 16.  Absolute error plot for Example 5.5.

    From the year 1920 to June 2018, as per \enquote{The Census Bureau's International Data Base} indicates that the world population data reached around 7.5 billion. This data is very accurate and near to our fractional model for the FO β=1.3932987548432. So, by our scheme, the numerical population data gives a more precise and appropriate solution than the fractional EM and fractional IEM.

    In this paper, the fractional RCM scheme is established for the IVP of FDE in CFD sense for the first time. Here, we do some analogous conversion of CFD of order β into an ODE of integer order one, and then we operate our proposed scheme in the revised problem. The numerical scheme was used directly without consuming the perturbation, linearization, or other assumptions. The convergence analysis and stability analysis of the scheme has been proved. Also, in this work, we demonstrated a comparative numerical study of our proposed scheme with the comparison of the existing scheme fractional EM and fractional IEM for various examples of linear and non-linear FDEs. The scheme also solves one real-world phenomenon: The fractional WPG model. Now, here we conclude the significant benefits of our scheme:

    ● The fractional RCM scheme has a cubic convergence rate which is slightly faster than the other linear and quadratic convergence methods for the IVP of FDEs.

    ● The idea of computation of the proposed scheme is better, and we can get the desired approximation with the increment of mesh points.

    ● With the help of the WPG model, we discovered that FDEs fit the model better than ODE.

    In the future, this work may be helpful to solve the IVP of FDE more accurately and effectively.

    The first and third author extended their appreciation to Distinguished Scientist Fellowship Program (DSFP) at King Saud University, Saudi Arabia.

    All authors declare no conflicts of interest.



    [1] P. M. Dung, On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games, Artif. Intell., 77 (1995), 321–357. https://dx.doi.org/10.1016/0004-3702(94)00041-X doi: 10.1016/0004-3702(94)00041-X
    [2] J. Ahmmad, T. Mahmood, R. Chinram, A. Lampan, Some average aggregation operators based on spherical fuzzy soft sets and their applications in multi-criteria decision making, AIMS Math., 6 (2021), 7798–7832. https://dx.doi.org/10.3934/math.2021454 doi: 10.3934/math.2021454
    [3] A. Saha, D. Dutta, S. kar, Some new hybrid hesitant fuzzy weighted aggregation operators based on archimedean and dombi operations for multi-attribute decision making, Neural Comput. Appl., 33 (2021), 8753–8776. https://dx.doi.org/10.1007/s00521-020-05623-x doi: 10.1007/s00521-020-05623-x
    [4] P. Baroni, F. Toni, B. Verheij, On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games: 25 years later, Argum. Comput., 11 (2020), 1–14. https://dx.doi.org/10.3233/AAC-200901 doi: 10.3233/AAC-200901
    [5] S. P. Ferrando, E. Onaindia, Defeasible-argumentation-based multi-agent planning, Inf. Sci., 411 (2017), 1–22. https://dx.doi.org/10.1016/j.ins.2017.05.014 doi: 10.1016/j.ins.2017.05.014
    [6] X. Li, X. Yang, S. Song, Lyapunov conditions for finite-time stability of time-varying time-delay systems, Automatica, 103 (2019), 135–140. https://dx.doi.org/10.1016/j.automatica.2019.01.031 doi: 10.1016/j.automatica.2019.01.031
    [7] K. Atkinson, T. Bench-Capon, Argumentation schemes in AI and law, Argum. Comput., 12 (2021), 417–434. https://dx.doi.org/10.3233/AAC-200543 doi: 10.3233/AAC-200543
    [8] I. Benedetti, S. Bistarelli, From argumentation frameworks to voting systems and back, Fund. Inform., 150 (2017), 25–48. https://dx.doi.org/10.3233/FI-2017-1459 doi: 10.3233/FI-2017-1459
    [9] J. Janssen, M. De Cock, D. Vermeir, Fuzzy argumentation frameworks, In: Information processing and management of uncertainty in knowledge-based systems, 2008,513–520.
    [10] J. Wu, L. Li, W. Sun, Gödel semantics of fuzzy argumentation frameworks with consistency degrees, AIMS Math., 5 (2020), 4045–4064. https://dx.doi.org/10.3934/math.2020260 doi: 10.3934/math.2020260
    [11] J. Wu, H. Li, N. Oren, T. J. Norman, Gödel fuzzy argumentation frameworks, In: Computational models of argument, IOS Press, 2016,447–458. https://dx.doi.org/10.3233/978-1-61499-686-6-447
    [12] L. Amgoud, J. Ben-Naim, Evaluation of arguments in weighted bipolar graphs, Int. J. Approx. Reason., 99 (2018), 39–55. https://dx.doi.org/10.1016/j.ijar.2018.05.004 doi: 10.1016/j.ijar.2018.05.004
    [13] L. Amgoud, J. Ben-Naim, Weighted bipolar argumentation graphs: Axioms and semantics, In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence Best Sister Conferences, AAAI Press, 2018, 5194–5198. https://dx.doi.org/10.24963/ijcai.2018/720
    [14] L. Amgoud, D. Doder, S. Vesic, Evaluation of argument strength in attack graphs: Foundations and semantics, Artif. Intell., 302 (2022), 103607. https://dx.doi.org/10.1016/j.artint.2021.103607 doi: 10.1016/j.artint.2021.103607
    [15] C. da Costa Pereira, A. G. Tettamanzi, P. Mcburney, Changing ones mind: Erase or rewind? Possibilistic belief revision with fuzzy argumentation based on trust, In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, AAAI Press, 2011,164–171. https://dx.doi.org/10.5591/978-1-57735-516-8/IJCAI11-039
    [16] C. da Costa Pereira, M. Dragoni, A. G. Tettamanzi, S. Villata, Fuzzy labeling for abstract argumentation: An empirical evaluation, In: Scalable uncertainty management, Springer, 2016,126–139. https://doi.org/10.1007/978-3-319-45856-4_9
    [17] L. Amgoud, J. Ben-Naim, D. Doder, S. Vesic, Acceptability semantics for weighted argumentation frameworks, In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017, 56–62. https://dx.doi.org/10.24963/ijcai.2017/9
    [18] P. Dondio, Multi-valued argumentation frameworks, In: Rules on the Web. From theory to applications, Springer, 2014,142–156. https://doi.org/10.1007/978-3-319-09870-8_10
    [19] P. E. Dunne, A. Hunter, P. McBurney, S. Parsons, M. Wooldridge, Weighted argument systems: Basic definitions, algorithms, and complexity results, Artif. Intell., 175 (2011), 457–486. https://dx.doi.org/10.1016/j.artint.2010.09.005 doi: 10.1016/j.artint.2010.09.005
    [20] M. Caminada, On the issue of reinstatement in argumentation, In: Logics in artificial intelligence, Springer, 2006,111–123. https://doi.org/10.1007/11853886_11
    [21] M. Caminada, An algorithm for computing semi-stable semantics, In: Symbolic and quantitative approaches to reasoning with uncertainty, Springer, 2007,222–234. https://doi.org/10.1007/978-3-540-75256-1_22
    [22] S. Dan, S. Majumder, M. B. Kar, K. Samarjit, On type-2 fuzzy weighted minimum spanning tree, Soft Comput., 25 (2021), 14873–14892. https://dx.doi.org/10.1007/s00500-021-06052-1 doi: 10.1007/s00500-021-06052-1
    [23] P. Baroni, M. Romano, F. Toni, M. Aurisicchio, G. Bertanza, Automatic evaluation of design alternatives with quantitative argumentation, Argum. Comput., 6 (2015), 24–49. https://dx.doi.org/10.1080/19462166.2014.1001791 doi: 10.1080/19462166.2014.1001791
    [24] P. Baroni, M. Giacomin, G. Guida, SCC-recursiveness: A general schema for argumentation semantics, Artif. Intell., 168 (2005), 162–210. https://dx.doi.org/10.1016/j.artint.2005.05.006 doi: 10.1016/j.artint.2005.05.006
    [25] F. Cerutti, M. Giacomin, M. Vallati, M. Zanella, A SCC recursive meta-algorithm for computing preferred labellings in abstract argumentation, In: Proceedings of the Fourteenth International Conference on Principles of Knowledge Representation and Reasoning, AAAI Press, 2014.
    [26] T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to algorithms, 3 Eds., The MIT Press, 2009.
    [27] X. Xie, T. Wei, X. Li, Hybrid event-triggered approach for quasi-consensus of uncertain multi-agent systems With impulsive protocols, IEEE Trans. Circuits Syst. I. Regul. Pap., 69 (2022), 872–883. https://dx.doi.org/10.1109/TCSI.2021.3119065 doi: 10.1109/TCSI.2021.3119065
    [28] X. Li, P. Li, Input-to-state stability of nonlinear systems: Event-triggered impulsive control, IEEE Trans. Automat. Control, 67 (2022), 1460–1465. https://dx.doi.org/10.1109/TAC.2021.3063227 doi: 10.1109/TAC.2021.3063227
    [29] X. Li, T. Zhang, J. Wu, Input-to-state stability of impulsive systems via event-triggered impulsive control, IEEE Trans. Cybernt., 2021, 1–9. https://dx.doi.org/10.1109/TCYB.2020.3044003 doi: 10.1109/TCYB.2020.3044003
    [30] X. Li, H. Zhu, S. Song, Input-to-state stability of nonlinear systems using observer-based event-triggered impulsive control, IEEE Trans. Syst. Man Cybernt., 51 (2021), 6892–6900. https://dx.doi.org/10.1109/TSMC.2020.2964172 doi: 10.1109/TSMC.2020.2964172
    [31] X. Li, D. Peng, J. Cao, Lyapunov stability for impulsive systems via event-triggered impulsive control, IEEE Trans. Automat. Control, 65 (2020), 4908–4913. https://dx.doi.org/10.1109/TAC.2020.2964558 doi: 10.1109/TAC.2020.2964558
    [32] X. Li, D. W. C. Ho, J. Cao, Finite-time stability and settling-time estimation of nonlinear impulsive systems, Automatica, 99 (2019), 361–368. https://dx.doi.org/10.1016/j.automatica.2018.10.024 doi: 10.1016/j.automatica.2018.10.024
    [33] X. Li, X. Yang, J. Cao, Event-triggered impulsive control for nonlinear delay systems, Automatica, 117 (2020), 108981. https://dx.doi.org/10.1016/j.automatica.2020.108981 doi: 10.1016/j.automatica.2020.108981
    [34] K. Skiba, T. Rienstra, M. Thimm, J. Heyninck, G. Kern-Isberner, Ranking extensions in abstract argumentation, In: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021, 2047–2053. https://dx.doi.org/10.24963/ijcai.2021/282
    [35] N. Oren, B. Yun, S. Vesic, M. Baptista, The inverse problem for argumentation gradual semantics, arXiv Preprint, 2022. https://doi.org/10.48550/arXiv.2202.00294
    [36] M. G. E. Gonzalez, M. C. D. Budán, G. I. Simari, G. R. Simari, Labeled bipolar argumentation frameworks, J. Artif. Intell. Res., 70 (2021), 1557–1636. https://dx.doi.org/10.1613/jair.1.12394 doi: 10.1613/jair.1.12394
    [37] M. C. D. Budán, G. I. Simari, I. Viglizzo, G. R. Simari, An approach to characterize graded entailment of arguments through a label-based framework, Int. J. Approx. Reason., 82 (2017), 242–269. https://dx.doi.org/10.1016/j.ijar.2016.12.016 doi: 10.1016/j.ijar.2016.12.016
    [38] R. Baumann, Splitting an argumentation framework, In: Logic programming and nonmonotonic reasoning, Springer, 2011, 40–53. https://doi.org/10.1007/978-3-642-20895-9_6
    [39] W. Dvořák, R. Pichler, S. Woltran, Towards fixed-parameter tractable algorithms for abstract argumentation, Artif. Intell., 186 (2012), 1–37. https://dx.doi.org/10.1016/j.artint.2012.03.005 doi: 10.1016/j.artint.2012.03.005
    [40] P. Baroni, M. Giacomin, B. Liao, On topology-related properties of abstract argumentation semantics. A correction and extension to dynamics of argumentation systems: A division-based method, Artif. Intell., 212 (2014), 104–115. https://dx.doi.org/10.1016/j.artint.2014.03.003 doi: 10.1016/j.artint.2014.03.003
    [41] B. Liao, L. Jin, R. C. Koons, Dynamics of argumentation systems: A division-based method, Artif. Intell., 175 (2011), 1790–1814. https://dx.doi.org/10.1016/j.artint.2011.03.006 doi: 10.1016/j.artint.2011.03.006
  • This article has been cited by:

    1. Pawan Kumar Shaw, Sunil Kumar, Shaher Momani, Samir Hadid, Dynamical analysis of fractional plant disease model with curative and preventive treatments, 2022, 164, 09600779, 112705, 10.1016/j.chaos.2022.112705
    2. Anil Kumar, Pawan Kumar Shaw, Sunil Kumar, Numerical investigation of pine wilt disease using fractal–fractional operator, 2024, 0973-1458, 10.1007/s12648-024-03298-x
  • Reader Comments
  • © 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1756) PDF downloads(34) Cited by(4)

Figures and Tables

Figures(5)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog