Cited in
(only showing first 100 items - show all)- Quantitative logic reasoning
- Multi-threaded ASP solving with clasp
- LMHS: a SAT-IP hybrid MaxSat solver
- Cardinality networks: a theoretical and empirical study
- Computer-aided proof of Erdős discrepancy properties
- On the complexity of reconstructing chemical reaction networks
- Reproducible efficient parallel SAT solving
- Kissat
- Paracooba
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- Learning rate based branching heuristic for SAT solvers
- Efficient CNF simplification based on binary implication graphs
- Improving implementation of SAT competitions 2017--2019 winners
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- ASlib: a benchmark library for algorithm selection
- Definability for model counting
- An adaptive prefix-assignment technique for symmetry reduction
- Propagation based local search for bit-precise reasoning
- DPLL+ROBDD derivation applied to inversion of some cryptographic functions
- Machine learning-based restart policy for CDCL SAT solvers
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
- SAT competition 2020
- Evaluating CDCL variable scoring schemes
- Simplified and improved separations between regular and general resolution by lifting
- The first international competition on computational models of argumentation: results and analysis
- Synchronous counting and computational algorithm design
- Optimal bounds for the no-show paradox via SAT solving
- AClib
- AIGER
- BooleForce
- CaDiCaL
- CryptoSAT
- MapleCOMSPS
- MapleCOMSPS_LRB
- reduce
- sunny-cp
- YalSAT
- SUNNY
- mkplot
- CnC
- HordeSat: a massively parallel portfolio SAT solver
- Blocked clause decomposition
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- AutoFolio
- HPOlib
- CCAnr
- cnf2aig
- countAntom
- CPSparrow
- gluHack
- Maple_LCM_Dist_ChronoBT
- NLocalSAT
- probSAT
- FourierSAT
- Sparrow2Riss
- Efficient benchmarking of algorithm configurators via model-based surrogates
- A constraint optimization approach to causal discovery from subsampled time series data
- A review of literature on parallel constraint solving
- Extreme cases in SAT problems
- Using Community Structure to Detect Relevant Learnt Clauses
- PaMira
- PaSAT
- Recognition of Nested Gates in CNF Formulas
- Scranfilize
- CoSA
- MergeSat
- PyPBLib
- cake_lpr
- QRATPre+
- SLIME
- Three-dimensional stable matching with cyclic preferences
- The configurable SAT solver challenge (CSSC)
- An overview of parallel SAT solving
- SAT race 2015
- On the construction of triples of diagonal Latin squares of order 10
- Automatic construction of parallel portfolios via algorithm configuration
- Leveraging GPUs for effective clause sharing in parallel SAT solving
- Between SAT and UNSAT: the fundamental difference in CDCL SAT
- Strategyproof social choice when preferences and outcomes may contain ties
- Laissez-faire caching for parallel \#SAT solving
- The \textsc{MergeSat} solver
- Incremental column-wise verification of arithmetic circuits using computer algebra
- c-sat
- HaifaSat
- kcnfs
- ManySAT
- March_eq
- MiniSat
- Paramils
- Pueblo
- SDSAT
- Saturn
- GridSAT
- PSATO
- FRODO__2
- Siege
- SATO
- Walksat
- SAT competition
This page was built for software: Lingeling
