Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

SMT-可满足性模理论 | XChy's Blog #3

Open
XChy opened this issue Apr 5, 2024 · 0 comments
Open

SMT-可满足性模理论 | XChy's Blog #3

XChy opened this issue Apr 5, 2024 · 0 comments
Labels
6026328899dc3effb681ee5ba4992a6d Gitalk

Comments

@XChy
Copy link
Owner

XChy commented Apr 5, 2024

https://blog.xchy.org/2023/11/23/SMT-Introduction/

SMT Solver 继上篇有关 SAT 的介绍，我们接着展开看看 SMT - Satisfiability Modulo Theories。 SAT 是基于布尔逻辑回答某个命题的可满足性，如(x \vee y)。但现实中有各种其他的理论， 如实数理论等：(a < c \vee a > b)，那我们怎么判断这种公式的可满足性呢？
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
6026328899dc3effb681ee5ba4992a6d Gitalk
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@XChy