开发者社区

文档建议反馈控制台

最新优惠活动

文章/答案/技术大牛

发布

社区首页 >专栏 >关于实用可满足性模理论（SMT）求解 Practical Satisfiability Modulo Theories (SMT) Solving

关于实用可满足性模理论（SMT）求解 Practical Satisfiability Modulo Theories (SMT) Solving

一个会写诗的程序员

发布于 2022-03-07 14:29:16

6880

发布于 2022-03-07 14:29:16

举报

文章被收录于专栏：一个会写诗的程序员的博客

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

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2021.08.05 ，如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自作者个人站点/博客前往查看

如有侵权，请联系 cloudcommunity@tencent.com 删除。

本文参与腾讯云自媒体同步曝光计划，欢迎热爱写作的你一起参与！

评论

登录后参与评论

0 条评论

热度

最新

LV.

目录

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.