Abstract
The effectiveness of many SAT algorithms is mainly reflected by their significant performances on one or several classes of specific SAT problems. Different kinds of SAT algorithms all have their own hard instances respectively. Therefore, to get the better performance on all kinds of problems, SAT solver should know how to select different algorithms according to the feature of instances. In this paper the differences of several effective SAT algorithms are analyzed and two new parameters ϕ and δ are proposed to characterize the feature of SAT instances. Experiments are performed to study the relationship between SAT algorithms and some statistical parameters including ϕ, δ. Based on this analysis, a strategy is presented for designing a faster SAT tester by carefully combining some existing SAT algorithms. With this strategy, a faster SAT tester to solve many kinds of SAT problem is obtained.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
