Treengeling
From MaRDI portal
swMATH13314MaRDI QIDQ25229FDOQ25229
Author name not available (Why is that?)
Official website: http://fmv.jku.at/lingeling/
Cited In (only showing first 100 items - show all)
- Improving implementation of SAT competitions 2017--2019 winners
- HordeSat: a massively parallel portfolio SAT solver
- Reproducible efficient parallel SAT solving
- Kissat
- Paracooba
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Simplified and improved separations between regular and general resolution by lifting
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- Three-dimensional stable matching with cyclic preferences
- Leveraging GPUs for effective clause sharing in parallel SAT solving
- ManySAT
- March_eq
- SDSAT
- InsEnc
- Plingeling
- GrADSAT
- Glucose
- PrecoSAT
- Runsolver
- CSP2SAT4J
- CryptoMiniSat
- GlueMiniSat
- PMSat
- ppfolio
- SArTagnan
- HERB
- Skeptik
- WILF
- CCASat
- pfolioUZK
- CryptLogVer
- DRAT-trim
- PBLib
- SATenstein
- raSAT
- IGraph/M
- Coprocessor
- HordeSat
- LMHS
- Spybug
- SpySMAC
- Transalg
- SAT race 2015
- ALIAS
- COMiniSatPS
- satUZK
- GPU-PRISM
- GPUexplore
- MaxHS
- ByMC
- CNFgen
- PaInleSS
- multi2boolean
- abcdSAT
- PySAT
- Splatz
- Syrup
- Lingeling
- PermStruct
- PermPAL
- AIGER
- CaDiCaL
- CryptoSAT
- MapleCOMSPS
- MapleCOMSPS_LRB
- reduce
- YalSAT
- mkplot
- CnC
- CCAnr
- cnf2aig
- countAntom
- Maple_LCM_Dist_ChronoBT
- probSAT
- Sparrow2Riss
- On the community structure of bounded model checking SAT problems
- An adaptive prefix-assignment technique for symmetry reduction
- PaMira
- PaSAT
- Scranfilize
- CoSA
- MergeSat
- cake_lpr
- SLIME
- Strategyproof social choice when preferences and outcomes may contain ties
- The configurable SAT solver challenge (CSSC)
- Automatic construction of parallel portfolios via algorithm configuration
- Computer-aided proof of Erdős discrepancy properties
- Lazy clause exchange policy for parallel SAT solvers
- Between SAT and UNSAT: the fundamental difference in CDCL SAT
- Cryptanalysis of Ascon
- SAT competition 2020
- Laissez-faire caching for parallel \#SAT solving
- Incremental column-wise verification of arithmetic circuits using computer algebra
- Partial order reduction for deep bug finding in synchronous hardware
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- DRABT
- Merging variables: one technique of search in pseudo-Boolean optimization
- Using merging variables-based local search to solve special variants of MaxSAT problem
This page was built for software: Treengeling
