Lingeling
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
- PyPBLib
- QRATPre+
- Paracooba
- Kissat
- SLIME
- cake_lpr
- SDSAT
- Saturn
- GridSAT
- PSATO
- FRODO__2
- Walksat
- Machine learning-based restart policy for CDCL SAT solvers
- Siege
- SATO
- The first international competition on computational models of argumentation: results and analysis
- A constraint optimization approach to causal discovery from subsampled time series data
- SAT competition
- Optimal bounds for the no-show paradox via SAT solving
- Propagation based local search for bit-precise reasoning
- Mozart
- \(\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
- PaQuBE
- Plingeling
- PicoSAT
- clasp
- GrADSAT
- LOOPS
- PrecoSAT
- Glucose
- versat
- SAT competition 2020
- Runsolver
- Covered clauses are not propagation redundant
- OptiLog: a framework for SAT-based systems
- Deep cooperation of CDCL and local search for SAT
- 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
- Bloqqer
- HeerHugo
- Open-WBO
- GlueMiniSat
- 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
- tawSolver
- New models for generating hard random Boolean formulas and disjunctive logic programs
- Clause vivification by unit propagation in CDCL SAT solvers
- Computing AES related-key differential characteristics with constraint programming
- Solving SAT in a distributed cloud: a portfolio approach
- Definability for model counting
- 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
- Set-blocked clause and extended set-blocked clause in first-order logic
- SArTagnan
- PMiniSAT
- NAGSAT
- PMSat
- Picoso
- antom
- ZetaSAT
- ppfolio
- WILF
- HERB
- On preprocessing techniques and their impact on propositional model counting
- Solution validation and extraction for QBF preprocessing
- claspfolio 2
- Skeptik
- MetExplore
- ABC
- CCASat
- pfolioUZK
- CryptLogVer
- DRAT-trim
This page was built for software: Lingeling
