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

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 (PDA), was constructed to perform routing management in communication networks.