2014
DOI: 10.4236/jsea.2014.75034
|View full text |Cite
|
Sign up to set email alerts
|

An Application of Paraconsistent Annotated Logic for Design Software Testing Strategies

Abstract: Nowadays, application model systems for decision-making based on non-classical logic such asParaconsistent Logic are used successfully in the treatment of uncertainties. The method presented in this paper is based on the fundamental concepts of Paraconsistent Annotated Logic with annotation of 2 values (PAL2v). In this study, two algorithms based on PAL2v are presented gradually, to extract the effects of the contradiction in signals of information from a database of uncertain knowledge. The Paraconsistent Ext… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 8 publications
(9 reference statements)
0
1
0
Order By: Relevance
“…The structure of the ParaExtr ctr algorithm aims to implement computational language source code programs for an optimal number of cyclomatic complexities around values lower than 10. In [ 37 ], the complexity of the ParaExtr ctr algorithm was calculated using McCabe’s cyclomatic analysis technique, where the network topology resulted in V ( G ) = 5. This value demonstrates that the paraconsistent algorithmic structure with the topology used in this research is of low complexity.…”
Section: Paraconsistent Logicmentioning
confidence: 99%
“…The structure of the ParaExtr ctr algorithm aims to implement computational language source code programs for an optimal number of cyclomatic complexities around values lower than 10. In [ 37 ], the complexity of the ParaExtr ctr algorithm was calculated using McCabe’s cyclomatic analysis technique, where the network topology resulted in V ( G ) = 5. This value demonstrates that the paraconsistent algorithmic structure with the topology used in this research is of low complexity.…”
Section: Paraconsistent Logicmentioning
confidence: 99%