Abstract: Recent years have seen a tremendous growth in the number of research and development groups at universities, research labs, and companies that have started using Boolean Satisfiability (SAT) ...
The Boolean satisfiability problem 1 (SAT) is an important decision problem solved by determining if a solution exists to a Boolean formula. A SAT instance is satisfiable when there exists an ...
The Boolean satisfiability (SAT) problem is a computationally challenging decision problem central to many industrial applications. For SAT problems in cryptanalysis, circuit design, and ...
Abstract: Boolean satisfiability (SAT) solvers have been the subject of remarkable improvements since the mid 90s. One of the main reasons for these improvements has been the wide range of practical ...
We propose ImitSAT, a branching policy for conflict-driven clause learning (CDCL) solvers based on imitation learning for the Boolean satisfiability problem (SAT). Unlike previous methods that predict ...
description [ICLR 2026][Graph Learning][GNN expressiveness] This paper rigorously proves, from the perspective of the Weisfeiler-Leman (WL) test, that the complete WL hierarchy cannot distinguish ...
If you've used Conda in deployments, you might have heard about the "satisfiability" problem. Basically, the package manager, behind the scenes, tries to solve a deceptively simple problem, called the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results