We propose a method for testing satisfiability based on Boolean rings. It makes heavy use of simplification, but avoids the potential size increase associated with the use of the distributive law. We present several complexity results that suggest why our method may be relatively effective in many cases. The framework is also amenable to the computation of intersections as in Stalmarck's method. Some experiments have been undertaken.