Tao Gu

A Complete Diagrammatic Calculus for Boolean Satisfiability

2023 · Electronic Notes in Theoretical Informatics and Computer Science

We propose a calculus of string diagrams to reason about satisfiability of Boolean formulas, and prove it to be sound and complete. We then showcase our calculus in a few case studies. First, we consider …