Plingeling
From MaRDI portal
Cited in
(only showing first 100 items - show all)- c-sat
- HaifaSat
- kcnfs
- ManySAT
- March_eq
- MiniSat
- Paramils
- Pueblo
- Scranfilize
- CoSA
- MergeSat
- Paracooba
- Kissat
- SLIME
- cake_lpr
- SDSAT
- UnitWalk
- Saturn
- GridSAT
- PSATO
- FRODO__2
- Machine learning-based restart policy for CDCL SAT solvers
- ALIAS: a modular tool for finding backdoors for SAT
- PySAT: a Python toolkit for prototyping with SAT oracles
- Siege
- SATO
- 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
- An empirical study of branching heuristics through the lens of global learning rate
- Coverage-based clause reduction heuristics for CDCL solvers
- 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
- SATzilla
- Chaff
- PaMiraXT
- PicoSAT
- GrADSAT
- LOOPS
- PrecoSAT
- Glucose
- SAT competition 2020
- 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
- LLBMC
- HeerHugo
- Open-WBO
- CryptoMiniSat
- Incremental column-wise verification of arithmetic circuits using computer algebra
- New ways to multiply \(3 \times 3\)-matrices
- Popularity-similarity random SAT formulas
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Propositional proof systems based on maximum satisfiability
- On the complexity of reconstructing chemical reaction networks
- On propositional coding techniques for the distinguishability of objects in finite sets
- Clause vivification by unit propagation in CDCL SAT solvers
- Solving SAT in a distributed cloud: a portfolio approach
- 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
- PMiniSAT
- PMSat
- antom
- ZetaSAT
- ppfolio
- WILF
- HERB
- Solution validation and extraction for QBF preprocessing
- Skeptik
- MetExplore
- CCASat
- pfolioUZK
- CryptLogVer
- DRAT-trim
- Treengeling
- PBLib
- SATenstein
- Community and LBD-based clause sharing policy for parallel SAT solving
- Distributed cube and conquer with Paracooba
- 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
- Learning rate based branching heuristic for SAT solvers
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- SpyBug: automated bug detection in the configuration space of SAT solvers
This page was built for software: Plingeling
