Plingeling
From MaRDI portal
Software:19149
No author found.
Related Items (80)
On the maximal minimal cube lengths in distinct DNF tautologies ⋮ Solution validation and extraction for QBF preprocessing ⋮ Partial Order Reduction for Deep Bug Finding in Synchronous Hardware ⋮ Nonexistence Certificates for Ovals in a Projective Plane of Order Ten ⋮ Laissez-Faire Caching for Parallel #SAT Solving ⋮ HordeSat: A Massively Parallel Portfolio SAT Solver ⋮ Between SAT and UNSAT: The Fundamental Difference in CDCL SAT ⋮ SAT race 2015 ⋮ DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs ⋮ A review of literature on parallel constraint solving ⋮ 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 ⋮ 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 ⋮ 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 ⋮ 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)\) ⋮ Computer-aided proof of Erdős discrepancy properties ⋮ Propagation based local search for bit-precise reasoning ⋮ \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms ⋮ An Expressive Model for Instance Decomposition Based Parallel SAT Solvers ⋮ Efficient benchmarking of algorithm configurators via model-based surrogates ⋮ Automatically comparing memory consistency models ⋮ Automatic discovery of structural rules of permutation classes ⋮ Incremental column-wise verification of arithmetic circuits using computer algebra ⋮ Local Negative Circuits and Cyclic Attractors in Boolean Networks with at most Five Components ⋮ Truth Assignments as Conditional Autarkies ⋮ New ways to multiply \(3 \times 3\)-matrices ⋮ An overview of parallel SAT solving ⋮ DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions ⋮ Efficient CNF Simplification Based on Binary Implication Graphs ⋮ Popularity-similarity random SAT formulas ⋮ Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions ⋮ Propositional proof systems based on maximum satisfiability ⋮ The configurable SAT solver challenge (CSSC) ⋮ Automatic construction of parallel portfolios via algorithm configuration ⋮ Parallelizing SMT solving: lazy decomposition and conciliation ⋮ Decision procedures. An algorithmic point of view ⋮ On the complexity of reconstructing chemical reaction networks ⋮ Cardinality networks: a theoretical and empirical study ⋮ Three-dimensional stable matching with cyclic preferences ⋮ Partitioning SAT Instances for Distributed Solving ⋮ On propositional coding techniques for the distinguishability of objects in finite sets ⋮ On dispersable book embeddings ⋮ An adaptive prefix-assignment technique for symmetry reduction ⋮ Cryptanalysis of Ascon ⋮ An adaptive prefix-assignment technique for symmetry reduction ⋮ On the completeness of bounded model checking for threshold-based distributed algorithms: reachability ⋮ Clause vivification by unit propagation in CDCL SAT solvers ⋮ Unnamed Item ⋮ Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem ⋮ Merging Variables: One Technique of Search in Pseudo-Boolean Optimization ⋮ Solving SAT in a distributed cloud: a portfolio approach ⋮ 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 ⋮ A computational complexity analysis of tunable type inference for Generic Universe Types ⋮ SAT competition 2020 ⋮ \(k\)-majority digraphs and the hardness of voting with a constant number of voters ⋮ Jdrasil: A Modular Library for Computing Tree Decompositions ⋮ Covered clauses are not propagation redundant ⋮ The resolution of Keller's conjecture ⋮ SAT-Based Preprocessing for MaxSAT ⋮ Blocked Clause Decomposition ⋮ 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
This page was built for software: Plingeling
