Paraconsistent Relations as a Variant of Kleene Algebras
By: Juliana Cunha, Alexandre Madeira, Luís S. Barbosa
Potential Business Impact:
Lets computers handle messy, unclear results.
Kleene algebras (KA) and Kleene algebras with tests (KAT) provide an algebraic framework to capture the behavior of conventional programming constructs. This paper explores a broader understanding of these structures, in order to enable the expression of programs and tests yielding vague or inconsistent outcomes. Within this context, we introduce the concept of a paraconsistent Kleene Algebra with tests (PKAT), capable of capturing vague and contradictory computations. Finally, to establish the semantics of such a structure, we introduce two algebras parametric on a class of twisted structures. We believe this sort of structures, for their huge flexibility, have an interesting application potential.
Similar Papers
Paraconsistent Constructive Modal Logic
Logic in Computer Science
Helps computers think about things that are both true and false.
Weighted GKAT: Completeness and Complexity
Logic in Computer Science
Makes computer programs easier to check for mistakes.
Kleene Algebra
Programming Languages
Proves computer programs are equal using math rules.