Plingeling
From MaRDI portal
swMATH7091MaRDI QIDQ19149FDOQ19149
Author name not available (Why is that?)
Official website: http://fmv.jku.at/lingeling/
Cited In (only showing first 100 items - show all)
- Distributed cube and conquer with Paracooba
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- Improving implementation of SAT competitions 2017--2019 winners
- Merging variables: one technique of search in pseudo-Boolean optimization
- Using merging variables-based local search to solve special variants of MaxSAT problem
- HordeSat: a massively parallel portfolio SAT solver
- Reproducible efficient parallel SAT solving
- Efficient all-UIP learned clause minimization
- OptiLog: a framework for SAT-based systems
- XOR local search for Boolean Brent equations
- Kissat
- Paracooba
- Mycielski graphs and PR proofs
- New ways to multiply \(3 \times 3\)-matrices
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Solving SAT in a distributed cloud: a portfolio approach
- Simplified and improved separations between regular and general resolution by lifting
- Parallelizing SMT solving: lazy decomposition and conciliation
- Community and LBD-based clause sharing policy for parallel SAT solving
- An expressive model for instance decomposition based parallel SAT solvers
- Partitioning SAT instances for distributed solving
- 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
- Efficient CNF simplification based on binary implication graphs
- Machine learning-based restart policy for CDCL SAT solvers
- Three-dimensional stable matching with cyclic preferences
- Leveraging GPUs for effective clause sharing in parallel SAT solving
- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten
- The resolution of Keller's conjecture
- SAT race 2015
- Covered clauses are not propagation redundant
- A constraint optimization approach to causal discovery from subsampled time series data
- Truth assignments as conditional autarkies
- An overview of parallel SAT solving
- SaDiCaL
- An empirical study of branching heuristics through the lens of global learning rate
- Optimal bounds for the no-show paradox via SAT solving
- Coverage-based clause reduction heuristics for CDCL solvers
- Scalable SAT solving in the cloud
- Solution validation and extraction for QBF preprocessing
- Title not available (Why is that?)
- Clause vivification by unit propagation in CDCL SAT solvers
- PaMira
- PaSAT
- Propagation based local search for bit-precise reasoning
- Scranfilize
- CoSA
- MergeSat
- cake_lpr
- SLIME
- Strategyproof social choice when preferences and outcomes may contain ties
- CrystalBall
- The configurable SAT solver challenge (CSSC)
- Local negative circuits and cyclic attractors in Boolean networks with at most five components
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- DPLL+ROBDD derivation applied to inversion of some cryptographic functions
- Automatic construction of parallel portfolios via algorithm configuration
- Cardinality networks: a theoretical and empirical study
- Computer-aided proof of Erdős discrepancy properties
- CUD@SAT
- Blocked clause decomposition
- Between SAT and UNSAT: the fundamental difference in CDCL SAT
- Learning rate based branching heuristic for SAT solvers
- Efficient benchmarking of algorithm configurators via model-based surrogates
- Decision procedures. An algorithmic point of view
- Cryptanalysis of Ascon
- The \textsc{MergeSat} solver
- SAT competition 2020
- SpyBug: automated bug detection in the configuration space of SAT solvers
- Incremental column-wise verification of arithmetic circuits using computer algebra
- Partial order reduction for deep bug finding in synchronous hardware
- DRABT
- Automatically comparing memory consistency models
- Automatic discovery of structural rules of permutation classes
- Popularity-similarity random SAT formulas
- Propositional proof systems based on maximum satisfiability
- An adaptive prefix-assignment technique for symmetry reduction
- On propositional coding techniques for the distinguishability of objects in finite sets
- Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres
- Tighter bounds on directed Ramsey number \(R(7)\)
- A computational complexity analysis of tunable type inference for Generic Universe Types
- On the maximal minimal cube lengths in distinct DNF tautologies
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- SAT-based preprocessing for MaxSAT
- HaifaSat
- ManySAT
- March_eq
- Pueblo
- SDSAT
- Siege
- SATO
- InsEnc
- SATzilla
- Chaff
- PaMiraXT
- PicoSAT
- GrADSAT
- LOOPS
This page was built for software: Plingeling