Plingeling

swMATH7091MaRDI QIDQ19149FDOQ19149

Author name not available (Why is that?)

Cited In (80)

• 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
• Partial Order Reduction for Deep Bug Finding in Synchronous Hardware
• 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
• Distributed cube and conquer with Paracooba
• \(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
• DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions
• Learning Rate Based Branching Heuristic for SAT Solvers
• Blocked Clause Decomposition
• 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
• Solving SAT in a distributed cloud: a portfolio approach
• 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
• 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
• 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
• Jdrasil: A Modular Library for Computing Tree Decompositions
• 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
• HordeSat: A Massively Parallel Portfolio SAT Solver
• An Expressive Model for Instance Decomposition Based Parallel SAT Solvers
• 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
• An overview of parallel SAT solving
• 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
• 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
• SAT-Based Preprocessing for MaxSAT
• Title not available (Why is that?)
• Clause vivification by unit propagation in CDCL SAT solvers
• Efficient CNF Simplification Based on Binary Implication Graphs
• 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
• Automatic construction of parallel portfolios via algorithm configuration
• Cardinality networks: a theoretical and empirical study
• Computer-aided proof of Erdős discrepancy properties
• ALIAS: a modular tool for finding backdoors for SAT
• PySAT: a Python toolkit for prototyping with SAT oracles
• Efficient benchmarking of algorithm configurators via model-based surrogates
• Decision procedures. An algorithmic point of view
• Cryptanalysis of Ascon
• The \textsc{MergeSat} solver
• Partitioning SAT Instances for Distributed Solving
• Truth Assignments as Conditional Autarkies
• SAT competition 2020
• Incremental column-wise verification of arithmetic circuits using computer algebra

This page was built for software: Plingeling