Machine learning for automated theorem proving: Learning to solve SAT and QSAT
SB Holden - Foundations and Trends® in Machine Learning, 2021 - nowpublishers.com
The decision problem for Boolean satisfiability, generally referred to as SAT, is the
archetypal NP-complete problem, and encodings of many problems of practical interest exist …
archetypal NP-complete problem, and encodings of many problems of practical interest exist …
An overview of parallel SAT solving
Boolean satisfiability (SAT) solvers are currently very effective in practice. However, there
are still many challenging problems for SAT solvers. Nowadays, extra computational power …
are still many challenging problems for SAT solvers. Nowadays, extra computational power …
The quest for efficient boolean satisfiability solvers
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in
not just the theoretical computer science community, but also in areas where practical …
not just the theoretical computer science community, but also in areas where practical …
Pseudo-Boolean and cardinality constraints
O Roussel, V Manquinho - Handbook of satisfiability, 2021 - ebooks.iospress.nl
Pseudo-Boolean and cardinality constraints are a natural generalization of clauses. While a
clause expresses that at least one literal must be true, a cardinality constraint expresses that …
clause expresses that at least one literal must be true, a cardinality constraint expresses that …
MiniMaxSAT: An efficient weighted Max-SAT solver
In this paper we introduce MiniMaxSat, a new Max-SAT solver that is built on top of MiniSat+.
It incorporates the best current SAT and Max-SAT techniques. It can handle hard clauses …
It incorporates the best current SAT and Max-SAT techniques. It can handle hard clauses …
[图书][B] Improving combinatorial optimization
GG Chu - 2011 - minerva-access.unimelb.edu.au
Combinatorial Optimization is an important area of computer science that has many
theoretical and practical applications. In this thesis, we present important contributions to …
theoretical and practical applications. In this thesis, we present important contributions to …
MiniMaxSat: A new weighted Max-SAT solver
In this paper we introduce MiniMaxSat, a new Max-SAT solver that incorporates the best
SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction …
SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction …
The SAT2002 competition
SAT Competition 2002 held in March–May 2002 in conjunction with SAT 2002 (the Fifth
International Symposium on the Theory and Applications of Satisfiability Testing). About 30 …
International Symposium on the Theory and Applications of Satisfiability Testing). About 30 …
[PDF][PDF] Conflict-driven clause learning sat solvers
A Biere, M Heule, H van Maaren, T Walsh - Handbook of Satisfiability …, 2009 - ics.uci.edu
One of the main reasons for the widespread use of SAT in many applications is that Conflict-
Driven Clause Learning (CDCL) Boolean Satisfiability (SAT) solvers are so effective in …
Driven Clause Learning (CDCL) Boolean Satisfiability (SAT) solvers are so effective in …
Property learning techniques for efficient generation of directed tests
Property falsification in model checking is widely used for automated generation of directed
tests. Due to state space explosion problem, traditional model checking techniques cannot …
tests. Due to state space explosion problem, traditional model checking techniques cannot …