Recommendations
Cites work
- scientific article; zbMATH DE number 939919 (Why is no real title available?)
- scientific article; zbMATH DE number 784042 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Automated benchmarking of incremental SAT and QBF solvers
- Between SAT and UNSAT: the fundamental difference in CDCL SAT
- Blocked clause decomposition
- Blocked clause elimination
- GRASP: a search algorithm for propositional satisfiability
- Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
- Improving resource-unaware SAT solvers
- Inprocessing rules
- Lazy clause exchange policy for parallel SAT solvers
- ManySAT: a parallel SAT solver
- Optimal speedup of Las Vegas algorithms
- PBLib -- a library for encoding pseudo-Boolean constraints into CNF
- Recognition of Nested Gates in CNF Formulas
- The complexity of theorem-proving procedures
- Theorem proving using lazy proof explication.
- Theory and Applications of Satisfiability Testing
Cited in
(9)- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- On black-box optimization in divide-and-conquer SAT solving
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
- Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way
- On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers
- SAT competition 2020
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
- Theory and Applications of Satisfiability Testing
- The \textsc{MergeSat} solver
Describes a project that uses
Uses Software
This page was built for publication: SAT race 2015
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334795)
