Intersection-Based Methods for Satisfiability Using Boolean Rings

Abstract

A potential advantage of using a Boolean-ring formalism for propositional formulæ is the large measure of simplification it facilitates. We propose a combined linear and binomial representation for Boolean ring polynomials, with which one can easily apply Gaussian elimination and Horn-clause methods to advantage. The framework is especially amenable to… (More)

Topics

2 Figures and Tables