关于实用可满足性模理论（SMT）求解 Practical Satisfiability Modulo Theories (SMT) Solving...
Posted 东海陈光剑
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了关于实用可满足性模理论（SMT）求解 Practical Satisfiability Modulo Theories (SMT) Solving...相关的知识，希望对你有一定的参考价值。
In computer science and mathematical logic, the satisfiability modulo theories (SMT) problem is a decision problem for logical formulas with respect to combinations of background theories expressed in classical first-order logic with equality. Examples of theories typically used in computer science are the theory of real numbers, the theory of integers, and the theories of various data structures such as lists, arrays, bit vectors and so on. SMT can be thought of as a form of the constraint satisfaction problem and thus a certain formalized approach to constraint programming.
https://en.wikipedia.org/wiki/Satisfiability_modulo_theories
以上是关于关于实用可满足性模理论（SMT）求解 Practical Satisfiability Modulo Theories (SMT) Solving...的主要内容，如果未能解决你的问题，请参考以下文章