Treengeling
From MaRDI portal
Cited in
(only showing first 100 items - show all)- c-sat
- kcnfs
- ManySAT
- March_eq
- MiniSat
- Scranfilize
- CoSA
- MergeSat
- Paracooba
- Kissat
- SLIME
- cake_lpr
- SDSAT
- PSATO
- Machine learning-based restart policy for CDCL SAT solvers
- A constraint optimization approach to causal discovery from subsampled time series data
- Optimal bounds for the no-show paradox via SAT solving
- On the community structure of bounded model checking SAT problems
- Propagation based local search for bit-precise reasoning
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- Efficient benchmarking of algorithm configurators via model-based surrogates
- Parallelizing SMT solving: lazy decomposition and conciliation
- InsEnc
- Plingeling
- GrADSAT
- PrecoSAT
- Glucose
- SAT competition 2020
- Runsolver
- Covered clauses are not propagation redundant
- OptiLog: a framework for SAT-based systems
- Efficient all-UIP learned clause minimization
- The \textsc{MergeSat} solver
- XOR local search for Boolean Brent equations
- Leveraging GPUs for effective clause sharing in parallel SAT solving
- Scalable SAT solving in the cloud
- GlueMiniSat
- CSP2SAT4J
- CryptoMiniSat
- Incremental column-wise verification of arithmetic circuits using computer algebra
- New ways to multiply \(3 \times 3\)-matrices
- Popularity-similarity random SAT formulas
- Propositional proof systems based on maximum satisfiability
- On propositional coding techniques for the distinguishability of objects in finite sets
- Clause vivification by unit propagation in CDCL SAT solvers
- A computational complexity analysis of tunable type inference for Generic Universe Types
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- SArTagnan
- PMSat
- ppfolio
- WILF
- HERB
- Solution validation and extraction for QBF preprocessing
- Skeptik
- CCASat
- pfolioUZK
- CryptLogVer
- DRAT-trim
- PBLib
- SATenstein
- Community and LBD-based clause sharing policy for parallel SAT solving
- Reproducible efficient parallel SAT solving
- Improving implementation of SAT competitions 2017--2019 winners
- Simplified and improved separations between regular and general resolution by lifting
- Mycielski graphs and PR proofs
- Strategyproof social choice when preferences and outcomes may contain ties
- Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres
- Tighter bounds on directed Ramsey number \(R(7)\)
- raSAT
- IGraph/M
- Cryptanalysis of Ascon
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- SpyBug: automated bug detection in the configuration space of SAT solvers
- HordeSat
- LMHS
- Coprocessor
- Spybug
- SpySMAC
- Transalg
- Using machine translation to provide target-language edit hints in computer aided translation based on translation memories
- COMiniSatPS
- satUZK
- GPU-PRISM
- GPUexplore
- Lazy clause exchange policy for parallel SAT solvers
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Truth assignments as conditional autarkies
- MaxHS
- SAT race 2015
- ByMC
- PaInleSS
- CNFgen
- Laissez-faire caching for parallel \#SAT solving
- HordeSat: a massively parallel portfolio SAT solver
- Between SAT and UNSAT: the fundamental difference in CDCL SAT
- multi2boolean
- PySAT
- ALIAS
- abcdSAT
- Syrup
This page was built for software: Treengeling
