搜索资源列表
MiraXTSimp_V1.1
- 多核环境下运行了可满足性分析的工具软件，能够使你充分了解多核编程技术-Multi-core environment running satisfiability analysis tools, enabling you to fully understand the multi-core programming technology
rsat_2
- 最快速的可满足性分析工具软件，曾经获得比赛的冠军，能够让学习者，学很多的编程技巧-The fastest satisfiability analysis tool software, has won the championship, will allow learners, learning a lot of programming skills
sat
- 可满足性问题（SAT),NP完全问题 并行算法 MPI-satisfiability problem(SAT) MPI,NP PROBLEM
practical_design_verification
- Improve design efficiency and reduce costs with this practical guide to formal and simulation-based functional verification. Giving you a theoretical and practical understanding of the key issues involved, expert aut
sat
- SAT问题也称为合取范式的可满足问题，一个合取范式形如：A1∧A2∧…∧An，子句Ai（1≤i≤n）形如：a1∨a2∨…∨ak，其中，ai称为文字，为某一布尔变量或该布尔变量的非。SAT问题是指：是否存在一组对所有布尔变量的赋值（TRUE或FALSE），使得整个合取范式取值为真。-SAT problem is also known as conjunctive normal form satisfiability problem, a
HandboSatisfiab_ebookw.net
- HANDBOOK OF SATISFIABILITY (sat problem)
SAT
- SAT问题也称为合取范式的可满足问题，一个合取范式形如：A1∧A2∧…∧An，子句Ai（1≤i≤n）形如：a1∨a2∨…∨ak，其中，ai称为文字，为某一布尔变量或该布尔变量的非。SAT问题是指：是否存在一组对所有布尔变量的赋值（TRUE或FALSE），使得整个合取范式取值为真。 -SAT problems are also called conjunctive normal form of the satisfiability
wsat
- 可满足性sat问题，使用C++语言进行编写，非常好，可以帮助初步理解-Sat satisfiability problem, use C++ written language, very good, you can help a preliminary understanding
Circuit-Satisfiability
- MPI与OpenMP并行程序设计（C语言版）示例程序-MPI and OpenMP parallel programming (C language version) sample program
Blackbox45
- Blackbox是通过将STRIPS的entire说明转换为布尔型满足问题的规划系统，用于解决多种当前满足的引擎，融合了约束满足和图规划技术。 -Blackbox is a planning system that works by converting problems specified in STRIPS notation into Boolean satisfiability problems, and then solvi
Desktop
- 用于求解sat可满足性问题，输入一个式子，判断是否始终满足(Solving the satisfiability problem of SAT,Enter a style to judge whether it is always satisfied)