1) finite satisfiability
有限可满足性
1.
The finite satisfiability and infinite satisfiability of sentences in first-order field theory on the language {+, ·, 0, 1} are considered, and some preliminary conclusions are obtained.
考察了语言｛十，·，０，１｝上１阶域论命题的有限可满足性及无限可满足性，得到一些初步结论。
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) λ-satisfiability
λ-可满足性
5) countable satiation
可数满足性
6) Limitation Satisfying Problem
限定性满足问题
1.
Transmission Validity and Limitation Satisfying Problem of Multi-Agent Networks within Small World Network Topology;
小世界网络拓扑下的多Agent网络传输有效性和限定性满足问题研究
补充资料：连续性与非连续性(见间断性与不间断性)
连续性与非连续性(见间断性与不间断性)
continuity and discontinuity
11an父ux泊g四f“山。麻以角g、.连续性与非连续性(c。nt，n琳t:nuity一)_见间断性与不间断性。and diseo红ti-
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条