1) λ-satisfiability
λ-可满足性
2) satisfiability
[,sætisfaiə'biliti]
可满足性
1.
RTL hybrid satisfiability solving methods are classified into two categories:One is based on SMT(Satisfiability Modulo Theories),and the other is based on circuit structure searching.
RTL混合可满足性求解方法分为基于可满足性模理论(SMT)和基于电路结构搜索两大类。
2.
Two heuristic strategies for solving satisfiability (SAT) problem were presented.
提出了两个用于求解可满足性 (SAT)问题的启发式策略。
3.
The key reasoning tasks of the semantic Web can be reduced to deciding the satisfiability of formulas.
语义网的关键推理问题可以化为公式的可满足性判定问题。
4) countable satiation
可数满足性
5) boolean satisfiability
布尔可满足性
1.
The Boolean Satisfiability is one of the most fundamental problems in computer science and a variety of algorithms-including the well-known search-based SAT algorithms-have been proposed.
布尔可满足性是计算机科学中最基础的问题之一,已经出现了包括著名的基于查找的SAT算法在内的各种算法。
2.
In this paper, an efficient method integrating logic simulation and Boolean satisfiability (SAT) is presented, which can verify the designs with black boxes.
该文提出了一种结合逻辑模拟和布尔可满足性的黑盒验证方法 ,用于验证设计中黑盒外部的功能正确性 。
6) circuit SAT solver
电路可满足性
补充资料：连续性与非连续性(见间断性与不间断性)
连续性与非连续性(见间断性与不间断性)
continuity and discontinuity
11an父ux泊g四f“山。麻以角g、.连续性与非连续性(c。nt，n琳t:nuity一)_见间断性与不间断性。and diseo红ti-
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条