https://openreview.net/forum?id=HJMC_iA5tm
Learning a SAT Solver from Single-Bit Supervision | OpenReview
We train a graph network to predict boolean satisfiability and show that it learns to search for solutions, and that the solutions it finds can be decoded from...
a satlearningsolversinglebit
https://openreview.net/forum?id=dN3XPysIuG&referrer=%5Bthe%20profile%20of%20Tobias%20Fuchs%5D(%2Fprofile%3Fid%3D~Tobias_Fuchs1)
Active Learning for SAT Solver Benchmarking | OpenReview
Benchmarking is a crucial phase when developing algorithms. This also applies to solvers for the SAT (propositional satisfiability) problem. Benchmark...
active learningsat solverbenchmarkingopenreview
https://easychair.org/smart-slide/slide/jc1s
Dinosat: a SAT Solver with Native DNF Support
a satsolvernativednfsupport
https://www.easychair.org/publications/paper/b7Cr
A Verified SAT Solver Framework including Optimization and Partial Valuations
sat solververifiedframeworkincludingoptimization
https://deepai.org/publication/a-parallel-and-distributed-quantum-sat-solver-based-on-entanglement-and-quantum-teleportation
A Parallel and Distributed Quantum SAT Solver Based on Entanglement and Quantum Teleportation |...
Aug 7, 2023 - 08/07/23 - Boolean satisfiability (SAT) solving is a fundamental problem in computer science. Finding efficient algorithms for SAT solving ha...
sat solverbased onparalleldistributedquantum
https://www.codingame.com/training/hard/horn-sat-solver
Practice Horn-SAT and DIMACS with the exercise "Horn-SAT solver"
Want to practice Horn-SAT and DIMACS? Try to solve the coding challenge "Horn-SAT solver".
horn satwith thepracticedimacsexercise