Weighted GKAT: Completeness and Complexity
By: Spencer Van Koevering, Wojciech Różowski, Alexandra Silva
Potential Business Impact:
Makes computer programs easier to check for mistakes.
We propose Weighted Guarded Kleene Algebra with Tests (wGKAT), an uninterpreted weighted programming language equipped with branching, conditionals, and loops. We provide an operational semantics for wGKAT using a variant of weighted automata and introduce a sound and complete axiomatization. We also provide a polynomial time decision procedure for bisimulation equivalence.
Similar Papers
Paraconsistent Relations as a Variant of Kleene Algebras
Logic in Computer Science
Lets computers handle messy, unclear results.
Active Learning of Symbolic NetKAT Automata
Programming Languages
Teaches computers to understand network traffic automatically.
KG-Augmented Executable CoT for Mathematical Coding
Artificial Intelligence
Helps computers solve math and write code better.