This work proposes an end-to-end approach for handcrafted Feature-Free SAT Solver Selection, called F2S3, which effectively captures the structural complexity of graph data, eliminates the need for handcrafted features, and improves feature representation in the low-dimensional space.
Yitao Zhang, Xiao Yang, Yong Lai et al.· Proceedings of the 32nd ACM...· 0 citations
Boolean Satisfiability (SAT) Problem is a cornerstone in computer science and artificial intelligence, underpinning numerous applications. Since no single SAT solver dominates all problem instances, SAT Solver Selection (SSS) leverages machine learning to dynamically choose the most effective algorithm. However, tradit...
Yitao Zhang, Xiao Yang, Yong Lai et al.· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.