论文标题
布尔值的完整示意分子
A Complete Diagrammatic Calculus for Boolean Satisfiability
论文作者
论文摘要
我们提出了一个弦图的演算，以推理布尔公式的满意度，并证明其声音和完整。然后，我们在一些案例研究中展示了我们的演算。首先，我们考虑坐着。其次，我们考虑了Horn条款，这使我们成为了一种新的决策方法，用于在Herbrand模型语义下进行命题逻辑程序等价。
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 SAT-solving. Second, we consider Horn clauses, which leads us to a new decision method for propositional logic programs equivalence under Herbrand model semantics.
