Instruct: Given a scientific paper title, retrieve paper titles that are cited by the given paper
Query: Deep Bound Hardware Model Checking Instances , Quadratic Propagations Benchmarks and Reencoded Factorization Problems Submitted to the SAT Competition 2017
An Extensible SAT-solver
A survey of recent advances in SAT-based formal verification
Z3: An Efficient SMT Solver
Improving WalkSAT By Effective Tie-Breaking and Efficient Implementation
Complexity of k-SAT
An Exhaustive DPLL Algorithm for Model Counting
Symbolic Model Checking using Zero-suppressed Decision Diagrams
Symbolic model checking without BDDs
Linear-time algorithms for testing the satisfiability of propositional horn formulae
Stochastic local search for satisfiability modulo theories
A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
Diversified Top-k Partial MaxSAT Solving
Planning as Satisfiability: Heuristics
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving
OptiMathSAT: A Tool for Optimization Modulo Theories
A Dynamic Approach for MPE and Weighted MAX-SAT
Solving the all-interval series problem: SAT vs CP
Solving Rubik's Cube Using SAT Solvers
SAT solving using FPGA-based heterogeneous computing
Local Search Algorithms for SAT: An Empirical Evaluation
A Survey on 5G: The Next Generation of Mobile Communication
Polyinstantiation integrity in multilevel relations
New Techniques that Improve MACE-style Finite Model Finding
geographic information systems and public health : mapping the future .
From Pixels to Actions: Learning to Drive a Car with Deep Neural Networks