The following pages link to (Q4427902):
Displaying 15 items.
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures (Q862395) (← links)
- Efficiently checking propositional refutations in HOL theorem provers (Q1006729) (← links)
- A framework for satisfiability modulo theories (Q1037239) (← links)
- Zero, successor and equality in BDDs (Q1772774) (← links)
- Solving the resolution-free SAT problem by submodel propagation in linear time (Q1777398) (← links)
- A reduction from unbounded linear mixed arithmetic problems into bounded problems (Q1799094) (← links)
- Efficient theory combination via Boolean search (Q2432765) (← links)
- Combining preorder and postorder resolution in a satisfiability solver (Q2741518) (← links)
- Satisfiability Modulo Theories (Q3176369) (← links)
- A Pearl on SAT Solving in Prolog (Q3558337) (← links)
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic (Q3608775) (← links)
- Classical Logic, Classical Probability, and Quantum Mechanics (Q5119653) (← links)
- Integrated and Automated Abstract Interpretation, Verification and Testing of C/C++ Modules (Q5187834) (← links)
- Computer Aided Verification (Q5312909) (← links)
- Synthesising programs with non-trivial constants (Q6161231) (← links)
