SAT competition 2016: Recent developments
We give an overview of SAT Competition 2016, the 2016 edition of thefamous competition
for Boolean satisfiability (SAT) solvers with over 20 years of history. A key aim is to point …
for Boolean satisfiability (SAT) solvers with over 20 years of history. A key aim is to point …
The science of brute force
The science of brute force Page 1 70 COMMUNICATIONS OF THE ACM | AUGUST 2017 |
VOL. 60 | NO. 8 review articles ILL US TRA TION B Y PETER CRO W THER A SSOCIA TE S …
VOL. 60 | NO. 8 review articles ILL US TRA TION B Y PETER CRO W THER A SSOCIA TE S …
Solving and verifying the boolean pythagorean triples problem via cube-and-conquer
Abstract The boolean Pythagorean Triples problem has been a longstanding open problem
in Ramsey Theory: Can the set N={1, 2,\dots\} of natural numbers be divided into two parts …
in Ramsey Theory: Can the set N={1, 2,\dots\} of natural numbers be divided into two parts …
On the glucose SAT solver
The set of novelties introduced with the SAT solver Glucose is now considered as a standard
for practical SAT solving. In this paper, we review the different strategies and technologies …
for practical SAT solving. In this paper, we review the different strategies and technologies …
[图书][B] Decision procedures
D Kroening, O Strichman - 2016 - Springer
A decision procedure is an algorithm that, given a decision problem, terminates with a
correct yes/no answer. In this book, we focus on decision procedures for decidable first …
correct yes/no answer. In this book, we focus on decision procedures for decidable first …
[PDF][PDF] Lingeling, plingeling and treengeling entering the sat competition 2013
A Biere - Proceedings of SAT competition, 2013 - researchportal.helsinki.fi
This paper serves as solver description for our SAT solver Lingeling and its two parallel
variants Treengeling and Plingeling entering the SAT Competition 2013. We only list …
variants Treengeling and Plingeling entering the SAT Competition 2013. We only list …
Schur number five
M Heule - Proceedings of the AAAI Conference on Artificial …, 2018 - ojs.aaai.org
We present the solution of a century-old problem known as Schur Number Five: What is the
largest (natural) number n such that there exists a five-coloring of the positive numbers up to …
largest (natural) number n such that there exists a five-coloring of the positive numbers up to …
Learning to solve circuit-sat: An unsupervised differentiable approach
S Amizadeh, S Matusevych… - … Conference on Learning …, 2019 - openreview.net
Recent efforts to combine Representation Learning with Formal Methods, commonly known
as the Neuro-Symbolic Methods, have given rise to a new trend of applying rich neural …
as the Neuro-Symbolic Methods, have given rise to a new trend of applying rich neural …
[HTML][HTML] SATenstein: Automatically building local search SAT solvers from components
Designing high-performance solvers for computationally hard problems is a difficult and
often time-consuming task. Although such design problems are traditionally solved by the …
often time-consuming task. Although such design problems are traditionally solved by the …
[PDF][PDF] MallobSat:: Scalable SAT Solving by Clause Sharing
SAT solving in large distributed environments has previously led to some famous results and
to impressive speedups for selected inputs. However, in terms of general-purpose SAT …
to impressive speedups for selected inputs. However, in terms of general-purpose SAT …