System Upgrade on Tue, May 28th, 2024 at 2am (EDT)
Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
Results: 1 - 1of1
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
MULTIRESOLUTION FOR SAT CHECKING
Preview AbstractThis paper presents a system based on new operators for handling sets of propositional clauses compactly represented by means of ZBDDs. The high compression power of such data structures allows efficient encodings of structured instances. A specialized operator for the distribution of sets of clauses is introduced and used for performing multiresolution on clause sets. Cut eliminations between sets of clauses of exponential size may then be performed using polynomial size data structures. The ZRES system, a new implementation of the Davis-Putnam procedure of 1960, solves two hard problems for resolution, that are currently out of the scope of the best SAT provers.