Showing cs.AIShow all
2 papers · 1 filter
cs.AI2023
Solving MaxSAT with Matrix Multiplication
David Warde-Farley, Vinod Nair, Yujia Li +3
We propose an incomplete algorithm for Maximum Satisfiability (MaxSAT) specifically designed to run on neural network accelerators such as GPUs and TPUs. Given a MaxSAT problem ins…
cs.AI2019
Prioritized Unit Propagation with Periodic Resetting is (Almost) All You Need for Random SAT Solving
Xujie Si, Yujia Li, Vinod Nair +1
We propose prioritized unit propagation with periodic resetting, which is a simple but surprisingly effective algorithm for solving random SAT instances that are meant to be hard.…