A propositionalization of a theory in First-Order Logic (FOL) is a set of propositional sentences that is satisfiable iff the original theory is satisfiable. We cannot translate arbitrary FOL theories to propositional logic because FOL is only semi-decidable. However, when possible, it is often advantageous to do so because we can use optimized, efficient SAT solvers (e.g. [Moskewicz et al., 20...

In this work we present a general approach for developing high-order compact differencing schemes by utilizing the governing differential equation to help approximate truncation error terms. As an illustrative application we consider the stream-function vorticity form of the Navier Stokes equations, and provide driven cavity results. Some extensions to treat non-constant metric coefficients res...