Lingeling
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Incremental column-wise verification of arithmetic circuits using computer algebra
- Laissez-faire caching for parallel \#SAT solving
- Local redundancy in SAT: generalizations of blocked clauses
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
- Computing AES related-key differential characteristics with constraint programming
- Using Community Structure to Detect Relevant Learnt Clauses
- Partial order reduction for deep bug finding in synchronous hardware
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Improving implementation of SAT competitions 2017--2019 winners
- DRABT
- Set-blocked clause and extended set-blocked clause in first-order logic
- On preprocessing techniques and their impact on propositional model counting
- Merging variables: one technique of search in pseudo-Boolean optimization
- Using merging variables-based local search to solve special variants of MaxSAT problem
- Multi-threaded ASP solving with clasp
- HordeSat: a massively parallel portfolio SAT solver
- Deep cooperation of CDCL and local search for SAT
- Efficient all-UIP learned clause minimization
- OptiLog: a framework for SAT-based systems
- XOR local search for Boolean Brent equations
- Reproducible efficient parallel SAT solving
- ASlib: a benchmark library for algorithm selection
- Automatic discovery of structural rules of permutation classes
- New ways to multiply \(3 \times 3\)-matrices
- Mycielski graphs and PR proofs
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Solving SAT in a distributed cloud: a portfolio approach
- Extreme cases in SAT problems
- Parallelizing SMT solving: lazy decomposition and conciliation
- Simplified and improved separations between regular and general resolution by lifting
- Popularity-similarity random SAT formulas
- Propositional proof systems based on maximum satisfiability
- Community and LBD-based clause sharing policy for parallel SAT solving
- An expressive model for instance decomposition based parallel SAT solvers
- Comments on: ``An overview of curriculum-based course timetabling
- Recognition of Nested Gates in CNF Formulas
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- On the complexity of reconstructing chemical reaction networks
- A review of literature on parallel constraint solving
- Machine learning-based restart policy for CDCL SAT solvers
- Efficient CNF simplification based on binary implication graphs
- Leveraging GPUs for effective clause sharing in parallel SAT solving
- c-sat
- HaifaSat
- kcnfs
- ManySAT
- March_eq
- MiniSat
- Paramils
- Pueblo
- SDSAT
- Saturn
- GridSAT
- PSATO
- FRODO__2
- Siege
- SATO
- Walksat
- SAT competition
- Mozart
- InsEnc
- SATzilla
- Chaff
- PaMiraXT
- PaQuBE
- clasp
- PicoSAT
- Plingeling
- GrADSAT
- LOOPS
- Glucose
- PrecoSAT
- versat
- Runsolver
- Bloqqer
- LLBMC
- HeerHugo
- CryptoMiniSat
- GlueMiniSat
- Open-WBO
- antom
- tawSolver
- NAGSAT
- Picoso
- PMiniSAT
- PMSat
- ppfolio
- SArTagnan
- claspfolio 2
- HERB
- ZetaSAT
- Skeptik
- WILF
- MetExplore
- ABC
- CCASat
- pfolioUZK
- CryptLogVer
- DRAT-trim
This page was built for software: Lingeling
