The Boolean satisfiability problem (SAT) is a fundamental NP-complete decision problem in
automated reasoning and mathematical logic. As evidenced by the results of SAT …

Maxim Gumin's WaveFunctionCollapse (WFC) algorithm is an example-driven image
generation algorithm emerging from the craft practice of procedural content generation. In …

Modern CDCL (conflict-driven clause learning) SAT solvers are used for many practical
applications. One of the key ingredients of state-of-the-art CDCL solvers are efficient restart …

Boolean SAT solvers are indispensable tools in a variety of domains in computer science
and engineering where efficient search is required. Not only does this relieve the burden on …

Satisfiability modulo theories solving is a technology to solve logically encoded problems for
many applications like verification, testing, or planning. Among the many theories that are …

There are many reasons to think that SAT solvers should be able to exploit formula structure,
but no standard techniques in modern CDCL solvers make explicit use of structure. We …

Recent universal-hashing based approaches to sampling and counting crucially depend on
the runtime performance of SAT solvers on formulas expressed as the conjunction of both …

Satisfiability modulo theories (SMT) solvers have been widely applied as the reasoning
engine for diverse software analysis and verification technologies. The efficiency of the SMT …

Boolean satisfiability (SAT) is an important performance-hungry problem with applications in
many problem domains. However, most work on parallelizing SAT solvers has focused on …

We prove that CDCL SAT-solvers with the ordered decision strategy and the DECISION
learning scheme are equivalent to ordered resolution. We also prove that, by replacing this …