We propose a method for testing satisfiability based on Boolean rings. We make heavy use of simplification, but avoid the potential size increase associated with the use of the distributive law. We present several complexity results, which suggest why our method may be relatively effective in many cases.

We prove that a generalized periodic, as well as a generalized Boolean, ring is either commutative or periodic. We also prove that a generalized Boolean ring with central idempotents must be nil or commutative. We further consider conditions which imply the commutativity of a generalized periodic, or a generalized Boolean, ring. 2000 Mathematics Subject Classification. 16D70, 16U80. Throughout,...

Ring-like quantum structures generalizing Boolean rings and having the property that the terms corresponding to the two normal forms of the symmetric difference in Boolean algebras coincide are investigated. Subclasses of these structures are algebraically characterized and related to quantum logic. In particular, a physical interpretation of the proposed model following Mackey’s approach to ax...

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 Booleanring polynomials with which one can easily apply Gaussian elimination and Horn-clause methods to advantage. We demonstrate that this framework, with its enhanced simplification, is especially ...