A Complete Diagrammatic Calculus for Boolean Satisfiability

11/22/2022
by   Tao Gu, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/10/2022

A Gödel Calculus for Linear Temporal Logic

We consider Gödel temporal logic (GTL), a variant of linear temporal log...
research
12/05/2021

Some remarks on semantics and expressiveness of the Sentential Calculus with Identity

Suszko's Sentential Calculus with Identity SCI results from classical pr...
research
07/05/2014

The Complexity of Reasoning with FODD and GFODD

Recent work introduced Generalized First Order Decision Diagrams (GFODD)...
research
03/27/2013

Generalizing Fuzzy Logic Probabilistic Inferences

Linear representations for a subclass of boolean symmetric functions sel...
research
04/29/2021

Tableau-based decision procedure for non-Fregean logic of sentential identity

Sentential Calculus with Identity (SCI) is an extension of classical pro...
research
09/01/2019

ExpTime Tableaux for Type PDL

The system of Type PDL (τPDL) is an extension of Propositional Dynamic L...
research
05/09/2019

On the Expressivity and Applicability of Model Representation Formalisms

A number of first-order calculi employ an explicit model representation ...

Please sign up or login with your details

Forgot password? Click here to reset