Paraconsistent Logic Algorithms Applied to Seasonal Comparative Analysis with Biomass Data Extracted by the Fouling Process

Filho, João Inácio da Silva; Caetano, Irapajy da Silva; Pontes, Floriana Nascimento; Mário, Maurício Conceição; Abe, Jair Minoro; Giordano, Fábio

doi:10.1007/978-3-319-19722-7_6

Cited by 2 publications

(8 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As seen in Figure 2 , the certainty degree of a real value ( D CR ) is obtained by determining the distance d (value between the paraconsistent logical state and the extreme logical state True t (or False f )) in the PAL2v lattice [ 11 , 27 , 28 , 29 , 30 , 31 , 32 , 33 , 34 ]:

…”

Section: Paraconsistent Logicmentioning

confidence: 99%

“…Figure 3 a shows the graph in which one can obtain the degree of evidence in the range of interest given by max value and min value from a measurement of greatness (measure X value ), being in this case the equation of a straight line [ 27 , 29 , 33 ].…”

Section: Paraconsistent Logicmentioning

confidence: 99%

“…The resulting evidence degree from the output is a value that expresses a representation of the analysis where the effect of the contradiction between the two values applied in its inputs is null [ 11 , 31 , 32 , 33 , 34 ].…”

Section: Paraconsistent Logicmentioning

confidence: 99%

“…The description of a PAN (Algorithm 2) is given below [ 11 , 29 , 33 ]. Algorithm 2: Paraconsistent analysis node (PAN): input: (mi, lambda), output : mi_er { Reading of the “mi” and “lambda” } { Initial Calculations } {Calculation of the contradiction degree } dg_dct ←(mi + lambda)−1; { contradiction degree value} { Calculation of the uncertaity degree } dg_dc ← mi–lambda; { uncertainty degree value } { Calculation of the d distance } d ← sqrt((1−| dg_dc|)^2 + (dg_dct)^2); { distance value } { Determination of the Real certainty degree } if (dg_dc >= 0) then dg_cr ← (1− d ) ; { Real certainty degree value } end_if if (dg_dc < 0) then dg_cr ← ( d −1) ; { Real certainty degree value } end_if { Determination of the Resulting evidence degree } mi_er ← (dg_cr + 1)/2; { Resulting evidence degree value} end_if {Return of the Resulting evidence degree in the output algorithm } return (“mi_er”) return (“mi_x”) Note: mi_x = favorable evidence degree (µ); lambda = unfavorable evidence degree ( λ ); dg_dct = contradiction degree ( Dct ); dg_dc = certainty degree ( Dc ); dg_cr = certainty degree of a real value ( D CR ); mi_er = resulting evidence degree ( μ ER ).

…”

Section: Paraconsistent Logicmentioning

confidence: 99%

“…The extractor of contradiction effects (ParaExtr ctr ) algorithm consists of a network of PANs that works through iterations [ 30 , 33 ]. With its recurrent operation, the algorithm is enabled to gradually remove the results or effects of the contradiction in groups of information signals.…”

Section: Paraconsistent Logicmentioning

confidence: 99%

See 4 more Smart Citations

Paraconsistent Annotated Logic Algorithms Applied in Management and Control of Communication Network Routes

Filho

Abe

Marreiro

et al. 2021

Sensors

Self Cite

View full text Add to dashboard Cite

This paper presents a computational method based on non-classical logic dedicated to routing management and information stream control in communication networks. Paraconsistent logic (PL) was used to create an algorithmic structure whose main property is to accept contradiction. Moreover, a computational structure, the denominated paraconsistent data analyzer (PDAPAL2v), was constructed to perform routing management in communication networks. Direct comparisons of PDAPAL2v with a classical logic system that simulates routing conditions were made in the laboratory. In the conventional system, the paraconsistent algorithms were considered as binary logic gates, and in the tests, the same adjustment limits of PDAPAL2v were applied. Using a database with controlled insertion of noise, we obtained an efficacy of 97% in the detection of deteriorated packets with PDAPAL2v and 72% with the conventional simulation system. Functional tests were carried out, showing that PDAPAL2v is able to assess the conditions and degradation of links and perform the analysis and correlation of various inputs and variables, even if the signals have contradictory values. From practical tests in the laboratory, the proposed method represents a new way of managing and controlling communication network routes with good performance.

show abstract

…”

Section: Paraconsistent Logicmentioning

confidence: 99%

Section: Paraconsistent Logicmentioning

confidence: 99%

Section: Paraconsistent Logicmentioning

confidence: 99%

…”

Section: Paraconsistent Logicmentioning

confidence: 99%

Section: Paraconsistent Logicmentioning

confidence: 99%

See 3 more Smart Citations

Paraconsistent Annotated Logic Algorithms Applied in Management and Control of Communication Network Routes

Filho

Abe

Marreiro

et al. 2021

Sensors

Self Cite

View full text Add to dashboard Cite

show abstract

Determination of an Atmospheric Condition Index with Evidential Annotated Paraconsistent Logic Tools

Carvalho

Abe

Bonilla

et al. 2022

RSD

View full text Add to dashboard Cite

The objective of this article is to propose the creation of an atmospheric condition index using Artificial Intelligence tools. The atmospheric condition can be obtained from parameters that the scientific communities – environment, health, labor safety – adopt for the different pollutants in the atmosphere. Parameters were obtained from the scientific literature and specialists, who were consulted about the objective data to allow an analysis through an expert system. As the data are from highly imprecise sources, classic-logic (binary) systems do not fit. We opted to use the Evidential Annotated Paraconsistent Logic. This non-classical logic naturally accommodates imprecisions, contradictions, and paracompleteness without the danger of trivialization. Thus, the Evidential Annotated Paraconsistent Logic can be ideally adopted as a valuable tool for controlling atmospheric conditions, especially in large metropolises.

show abstract

Paraconsistent Logic Algorithms Applied to Seasonal Comparative Analysis with Biomass Data Extracted by the Fouling Process

Cited by 2 publications

References 10 publications

Paraconsistent Annotated Logic Algorithms Applied in Management and Control of Communication Network Routes

Paraconsistent Annotated Logic Algorithms Applied in Management and Control of Communication Network Routes

Determination of an Atmospheric Condition Index with Evidential Annotated Paraconsistent Logic Tools

Contact Info

Product

Resources

About