Abstract
We propose a new switching criterion, namely the evenness or unevenness of the distribution of variable weights, and use this criterion to combine intensification and diversification in local search for SAT. We refer to the ways in which state-of-the-art local search algorithms adaptG2 W SATP and V W select a variable to flip, as heuristic adaptG2 W SATP and heuristic V W , respectively. To evaluate the effectiveness of this criterion, we apply it to heuristic adaptG2 W SATP and heuristic V W , in which the former intensifies the search better than the latter, and the latter diversifies the search better than the former. The resulting local search algorithm, which switches between heuristic adaptG2 W SATP and heuristic V W in every step according to this criterion, is called Hybrid. Our experimental results show that, on a broad range of SAT instances presented in this paper, Hybrid inherits the strengths of adaptG2 W SATP and V W , and exhibits generally better performance than adaptG2 W SATP and V W . In addition, Hybrid compares favorably with state-of-the-art local search algorithm R+adaptNovelty+ on these instances. Furthermore, without any manual tuning parameters, Hybrid solves each of these instances in a reasonable time, while adaptG2 W SATP , V W , and R+adaptNovelty+ have difficulty on some of these instances.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal on Satisfiability, Boolean Modeling and Computation
Disclaimer: 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.