YalSAT

swMATH31644MaRDI QIDQ43355FDOQ43355

Author name not available (Why is that?)

Cited In (23)

• Improving implementation of SAT competitions 2017--2019 winners
• Merging variables: one technique of search in pseudo-Boolean optimization
• Using merging variables-based local search to solve special variants of MaxSAT problem
• Efficient all-UIP learned clause minimization
• XOR local search for Boolean Brent equations
• Mycielski graphs and PR proofs
• New ways to multiply \(3 \times 3\)-matrices
• Popularity-similarity random SAT formulas
• Community and LBD-based clause sharing policy for parallel SAT solving
• Three-dimensional stable matching with cyclic preferences
• On propositional coding techniques for the distinguishability of objects in finite sets
• A constraint optimization approach to causal discovery from subsampled time series data
• Truth assignments as conditional autarkies
• Scalable SAT solving in the cloud
• An adaptive prefix-assignment technique for symmetry reduction
• Title not available (Why is that?)
• Clause vivification by unit propagation in CDCL SAT solvers
• Propagation based local search for bit-precise reasoning
• Local negative circuits and cyclic attractors in Boolean networks with at most five components
• On the maximal minimal cube lengths in distinct DNF tautologies
• The \textsc{MergeSat} solver
• SAT competition 2020
• Incremental column-wise verification of arithmetic circuits using computer algebra

This page was built for software: YalSAT