Treengeling
From MaRDI portal
Software:25229
swMATH13314MaRDI QIDQ25229FDOQ25229
Author name not available (Why is that?)
Cited In (62)
- Automatic discovery of structural rules of permutation classes
- An adaptive prefix-assignment technique for symmetry reduction
- Partial Order Reduction for Deep Bug Finding in Synchronous Hardware
- On the maximal minimal cube lengths in distinct DNF tautologies
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- Improving implementation of SAT competitions 2017--2019 winners
- 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
- SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers
- 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
- Lazy Clause Exchange Policy for Parallel SAT Solvers
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Between SAT and UNSAT: The Fundamental Difference in CDCL SAT
- Simplified and improved separations between regular and general resolution by lifting
- Parallelizing SMT solving: lazy decomposition and conciliation
- Popularity-similarity random SAT formulas
- Propositional proof systems based on maximum satisfiability
- Community and LBD-based clause sharing policy for parallel SAT solving
- Local Negative Circuits and Cyclic Attractors in Boolean Networks with at most Five Components
- Laissez-Faire Caching for Parallel #SAT Solving
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- Using Machine Translation to Provide Target-Language Edit Hints in Computer Aided Translation Based on Translation Memories
- 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
- Representative Encodings to Translate Finite CSPs into SAT
- HordeSat: A Massively Parallel Portfolio SAT Solver
- On propositional coding techniques for the distinguishability of objects in finite sets
- The resolution of Keller's conjecture
- SAT race 2015
- On dispersable book embeddings
- Covered clauses are not propagation redundant
- A constraint optimization approach to causal discovery from subsampled time series data
- On the community structure of bounded model checking SAT problems
- Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres
- Tighter bounds on directed Ramsey number \(R(7)\)
- Optimal bounds for the no-show paradox via SAT solving
- Scalable SAT solving in the cloud
- Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem
- Solution validation and extraction for QBF preprocessing
- An adaptive prefix-assignment technique for symmetry reduction
- Title not available (Why is that?)
- Clause vivification by unit propagation in CDCL SAT solvers
- Propagation based local search for bit-precise reasoning
- Merging Variables: One Technique of Search in Pseudo-Boolean Optimization
- Strategyproof social choice when preferences and outcomes may contain ties
- The configurable SAT solver challenge (CSSC)
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- A computational complexity analysis of tunable type inference for Generic Universe Types
- Automatic construction of parallel portfolios via algorithm configuration
- Computer-aided proof of Erdős discrepancy properties
- Efficient benchmarking of algorithm configurators via model-based surrogates
- Cryptanalysis of Ascon
- The \textsc{MergeSat} solver
- Truth Assignments as Conditional Autarkies
- SAT competition 2020
- Incremental column-wise verification of arithmetic circuits using computer algebra
This page was built for software: Treengeling