Search
Search Results
-
Evaluating state-of-the-art
# SAT solvers on industrial configuration spacesProduct lines are widely used to manage families of products that share a common base of features. Typically, not every combination (configuration)...
-
Monitoring of spatio-temporal properties with nonlinear SAT solvers
The automotive industry is increasingly dependent on computing systems with different critical requirements. The verification and validation methods...
-
Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers
Distributed clause-sharing SAT solvers can solve problems up to one hundred times faster than sequential SAT solvers by sharing derived information...
-
Speculative SAT Modulo SAT
State-of-the-art model-checking algorithms like IC3/PDR are based on uni-directional modular SAT solving for finding and/or blocking counterexamples....
-
Shared SAT Solvers and SAT Memory in Distributed Business Applications
We propose a software architecture where SAT solvers act as a shared network resource for distributed business applications. There can be multiple...
-
Variational satisfiability solving: efficiently solving lots of related SAT problems
Incremental satisfiability (SAT) solving is an extension of classic SAT solving that enables solving a set of related SAT problems by identifying and...
-
TaSSAT: Transfer and Share SAT
We present TaSSAT, a powerful local search SAT solver that effectively solves hard combinatorial problems. Its unique approach of transferring clause...
-
Single Constant Multiplication for SAT
This paper presents new methods of encoding the multiplication of a binary encoded integer variable with a constant value for Boolean Satisfiability...
-
On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers
SAT solvers are nowadays used in many applications where the UNSAT result has a special meaning that is at time critical. SAT instances sometimes...
-
Solving String Constraints Using SAT
String solvers are automated-reasoning tools that can solve combinatorial problems over formal languages. They typically operate on restricted...
-
Sampling configurations from software product lines via probability-aware diversification and SAT solving
Sampling a small, valid and representative set of configurations from software product lines (SPLs) is important, yet challenging due to a huge...
-
DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories
Generating proofs of unsatisfiability is a valuable capability of most SAT solvers, and is an active area of research for SMT solvers. This paper...
-
Towards Better Generalization for Neural Network-Based SAT Solvers
Neural network (NN) has demonstrated its astonishing power in many data mining tasks. Recently, NN is adapted to the boolean satisfiability (SAT)...
-
Algebraic and SAT models for SCA generation
In this paper, we compute sequence covering arrays (SCAs), which are arrays, consisting of sequences, such that all subsequences with pairwise...
-
ViolationLS: Constraint-Based Local Search in CP-SAT
We introduce ViolationLS, a Constraint-Based Local Search (CBLS) solver for arbitrary MiniZinc models based on the Feasibility Jump Mixed-Integer...
-
Active Learning for SAT Solver Benchmarking
Benchmarking is a crucial phase when develo** algorithms. This also applies to solvers for the SAT (propositional satisfiability) problem....
-
-
Core Boosting in SAT-Based Multi-objective Optimization
Maximum satisfiability (MaxSAT) constitutes today a successful approach to solving various real-world optimization problems through propositional...
-
Assessing Progress in SAT Solvers Through the Lens of Incremental SAT
There is a wide consensus, which is supported by the hard experimental evidence of the SAT competitions, that clear progress in SAT solver...
-
Never Trust Your Solver: Certification for SAT and QBF
Many problems for formal verification and artificial intelligence rely on advanced reasoning technologies in the background, often in the form of SAT...