- Automated reasoning
- >
- Automated theorem proving
- >
- Satisfiability problems
- >
- SMT solvers

- Complex systems theory
- >
- Computational complexity theory
- >
- NP-complete problems
- >
- SMT solvers

- Computational complexity theory
- >
- Computational problems
- >
- NP-complete problems
- >
- SMT solvers

- Computational complexity theory
- >
- Computational problems
- >
- Satisfiability problems
- >
- SMT solvers

- Computational mathematics
- >
- Automated theorem proving
- >
- Satisfiability problems
- >
- SMT solvers

- Formal methods
- >
- Automated theorem proving
- >
- Satisfiability problems
- >
- SMT solvers

- Logic in computer science
- >
- Automated theorem proving
- >
- Satisfiability problems
- >
- SMT solvers

- Logic programming
- >
- Automated theorem proving
- >
- Satisfiability problems
- >
- SMT solvers

- Mathematical logic
- >
- Automated theorem proving
- >
- Satisfiability problems
- >
- SMT solvers

- Mathematical problems
- >
- Computational problems
- >
- NP-complete problems
- >
- SMT solvers

- Mathematical problems
- >
- Computational problems
- >
- Satisfiability problems
- >
- SMT solvers

- Mathematical proofs
- >
- Automated theorem proving
- >
- Satisfiability problems
- >
- SMT solvers

- Mathematical tools
- >
- Mathematical software
- >
- Formal methods tools
- >
- SMT solvers

- Mathematics of computing
- >
- Formal methods
- >
- Formal methods tools
- >
- SMT solvers

- Mathematics of computing
- >
- Formal methods
- >
- Satisfiability problems
- >
- SMT solvers

- Mathematics of computing
- >
- Mathematical software
- >
- Formal methods tools
- >
- SMT solvers

- Theoretical computer science
- >
- Formal methods
- >
- Formal methods tools
- >
- SMT solvers

- Theoretical computer science
- >
- Formal methods
- >
- Satisfiability problems
- >
- SMT solvers

- Theory of computation
- >
- Computational complexity theory
- >
- NP-complete problems
- >
- SMT solvers

Satisfiability modulo theories

In computer science and mathematical logic, satisfiability modulo theories (SMT) is the problem of determining whether a mathematical formula is satisfiable. It generalizes the Boolean satisfiability

Z3 Theorem Prover

Z3, also known as the Z3 Theorem Prover, is a cross-platform satisfiability modulo theories (SMT) solver by Microsoft.

© 2023 Useful Links.