美文网首页
关于实用可满足性模理论(SMT)求解 Practical Sat

关于实用可满足性模理论(SMT)求解 Practical Sat

作者: 光剑书架上的书 | 来源:发表于2021-08-05 14:56 被阅读0次

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 listsarraysbit 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 Sat

      本文链接:https://www.haomeiwen.com/subject/akkmvltx.html