2000 character limit reached
Boolean Equi-propagation for Optimized SAT Encoding (1104.4617v1)
Published 24 Apr 2011 in cs.AI, cs.DS, and cs.LO
Abstract: We present an approach to propagation based solving, Boolean equi-propagation, where constraints are modelled as propagators of information about equalities between Boolean literals. Propagation based solving applies this information as a form of partial evaluation resulting in optimized SAT encodings. We demonstrate for a variety of benchmarks that our approach results in smaller CNF encodings and leads to speed-ups in solving times.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.