is satisfiable is one of the most fundamental problems in computer science, known as the canonical NP-complete Boolean satisfiability (SAT) problem (Biere et al. 2009). In addition to its theoretical importance, major advances in the development of robust implementations of decision procedures for SAT, SAT solvers, have established SAT as an important declarative approach for attacking various ...

Max-SAT is the problem of finding an assignment minimizing the number of unsatisfied clauses in a CNF formula. We propose a resolution-like calculus for Max-SAT and prove its soundness and completeness. We also prove the completeness of some refinements of this calculus. From the completeness proof we derive an exact algorithm for Max-SAT and a time upper bound. We also define a weighted Max-SA...

In this technical report we summarize the evolution of SAT solvers implemented at the formal methods group at ETH Zürich. We start with LIMMAT and COMPSAT, which both took part in the SAT’03 SAT solver competition. From the more ambitious design of FUNEX we reach the minimal implementation of NANOSAT. We close the discussion with an overview on how our QBF solver QUANTOR can be used as a prepro...

In this paper, we propose a new approach for solving the SAT problem. This approach consists in representing SAT instances thanks to an undirected graph issued from a polynomial transformation from SAT to the CLIQUE problem. Considering this graph, we exploit well known properties of chordal graphs to manipulate the SAT instance. Firstly, these properties allow us to define a new class of SAT p...

The scalability of SAT to very large problems has been achieved in the last ten years, due to substantially improved encodings, SAT solvers, and algorithms for scheduling the runs of SAT solvers. This has lead to SAT-based planners that are dramatically different from the earliest implementations based on the late 1990ies technology. We discuss a SATbased planning system that implements moderni...

The SAT Competitions constitute a well-established series of yearly open international algorithm implementation competitions, focusing on the Boolean satisfiability (or propositional satisfiability, SAT) problem. In this article, we provide detailed account 2020 instantiation Competition, including new competition tracks and benchmark selection procedures, overview solving strategies implemente...

The satissability (SAT) problem is a core problem in mathematical logic and computing theory. In practice, SAT is fundamental in solving many problems in automated reasoning, computer-aided design, computer-aided manufacturing, machine vision, database, robotics, integrated circuit design, computer architecture design, and computer network design. Traditional methods treat SAT as a discrete, co...

There is little evidence showing the relationship between the Scholastic Assessment Test (SAT) and g (general intelligence). This research established the relationship between SAT and g, as well as the appropriateness of the SAT as a measure of g, and examined the SAT as a premorbid measure of intelligence. In Study 1, we used the National Longitudinal Survey of Youth 1979. Measures of g were e...

The satis ability problem (SAT) is a fundamental problem in mathematical logic, constraint satisfaction, VLSI engineering, and computing theory. Methods to solve the satis ability problem play an important role in the development of computing theory and systems. In this paper, we give a BDD (Binary Decision Diagrams) SAT solver for practical asynchronous circuit design. The BDD SAT solver consi...