Abstract
The problem of satisfiability of the propositional logic formula (SAT problem) in computer science is an important and difficult problem. Learning clauses often contain redundant literal in CDCL SAT solving, which may have a negative impact on the performance of the solver. To overcome this shortcoming, we show a new sharpSAT solver based on learning clause minimization is proposed. By recoding the CNF formula to reduce the storage space, and applying Boolean constraint propagation to eliminate redundant literals in the learning clause, the algorithm reduces the time cost. The complexity is compared with the existing solver. The experimental results show that the solver has significant application value, reduces the time of instance solution, and increases the number of maximum solvable instances.
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 callMore From: IOP Conference Series: Earth and Environmental Science
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.
