Abstract: The fitness landscape of MAX-3-SAT is investigated for random instances above the satisfiability phase transition. This paper includes a scaling analysis of the time to reach a local optimum ...

Abstract: We present DeepSAT, a novel end-to-end learning framework for the Boolean satisfiability (SAT) problem. Unlike existing solutions trained on random SAT instances with relatively weak ...

Dead routes — a branch whose condition can never be true Ambiguous routing — two branches whose conditions can both hold simultaneously (first-match wins, but the intent is wrong) Unhandled states — a ...

For each network in the resulting set, we construct a propositional formula whose satisfiability is necessary for the existence of a sorting network of a given depth. Using an off-the-shelf SAT solver ...

Making Hard Problems Easier with Custom Data Distributions and Loss Regularization: A Case Study in Modular Arithmetic Disentangling and Integrating Relational and Sensory Information in Transformer ...