根据返回的布尔值，每条记录要么成为结果集的成员，要么被归为不满足搜索条件的记录放弃。
Based on the Boolean return value, the record either becomes a member of the result set or is tossed aside as a record that does not meet the search criteria.
8月10日的最新民调显示，仅有26%的被调查者满足他的成绩，较六月中旬的民调结果下降了18%之巨，而与此同时，认同陆克文先生作为首相的民众是认同特恩布尔先生的四倍。
A poll released on August 10th showed only 26% of voters approving of his performance, a plunge of 18 points since mid-June. Almost four times as many voters prefer Mr Rudd as prime minister.
喀布尔只有不多几所小诊所能帮助人们戒毒，但远远不能满足需要治疗的人数。
Kabul contains a tiny handful of clinics that treat drug abuse, but they have nowhere near the capacity to treat the number of people in need.
强调二进制的性质这一问题，这是经常被称为布尔或命题满足。
To emphasize the binary nature of this problem, it is frequently referred to as Boolean or propositional satisfiability.
德拉布尔认为当代女性在母爱中才能得到精神上的满足，从而肯定自我存在的价值，坚强地生活下去。
Drabble considers that only maternal love can make it possible for contemporary women to obtain spiritual satisfaction, thus affirming self value and taking heart to live.
它有效地结合了基于布尔可满足性、BDD和结构等方法各自的优点，可以有效地解决局部信号赋值之间的关联性。
This heuristics dovetail the respective strengths of BDD and SAT and circuit structure based methods to solve local signal correlations.
研究了极小布尔不可满足子式的提取算法，它分为近似算法和精确算法两种。
The paper is concerned with the algorithms for extraction of minimal unsatisfiable (mu) Boolean sub-formula. The algorithms include approximate and exact methods.
相关免疫且满足严格雪崩准则的布尔函数称为CI - SAC函数。
The Boolean function is called CI-SAC function if it is correlation immunity and satisfies strict avalanche criterion.
针对最小不可满足子式的求解问题，提出并证明了布尔公式最小不可满足性与极大可满足性之间的关系。
Based on the relationship, a compounded greedy genetic algorithm and an ant colony algorithm are proposed to derive a minimum unsatisfiable subformula.
布尔可满足性是计算机科学中最基础的问题之一，已经出现了包括著名的基于查找的SAT算法在内的各种算法。
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算法在内的各种算法。
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.
应用推荐