In the present paper, we propose a technology for translating algorithmic descriptions of
discrete functions to SAT. The proposed technology is aimed at applications in algebraic …

Over the last decade, parallel SATisfiability solving has been widely studied from both
theoretical and practical aspects. There are two main approaches. First, divide-and-conquer …

Cube and conquer is currently the most effective approach to solve hard combinatorial
problems in parallel. It organizes the search in two phases. First, a look-ahead solver splits …

In this paper, we present a Bayesian Moment Matching (BMM) based method aimed at
solving the initialization problem in Boolean SAT solvers. The initialization problem can be …

In this paper, we present a machine learning based splitting heuristic for divide-and-conquer
parallel Boolean SAT solvers. Splitting heuristics, whether they are look-ahead or look-back …

Over the last two decades, we have seen a dramatic improvement in the efficiency of conflict-
driven clause-learning Boolean satisfiability (CDCL SAT) solvers on industrial problems …

In recent years, cloud service providers have sold computation in increasingly granular
units. Most recently,“serverless” executors run a single executable with restricted network …

We present approaches to store and restore the state of a SAT solver, allowing us to migrate
the state between different compute resources, or even between different solvers. This can …

With the increasing availability of parallel computing power, there is a growing focus on
parallelizing algorithms for important automated reasoning problems such as Boolean …

Over the last two decades, we have seen a dramatic improvement in the efficiency of conflict-
driven clause-learning Boolean satisfiability (CDCL SAT) solvers over industrial problems …