satisfiability
英
美
n. 可满足性
双语例句
- The satisfiability problem of conjunction normal form ( abbreviate SAT problem) is an NP_complete problem.
合取范式可满足性问题（简称SAT问题）是一个NP完全问题。 - 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算法在内的各种算法。 - PIE Satisfiability Analysis Based on the Theory of Information Needs Level
基于信息需求层次理论的PIE可满足性分析 - Solving the Satisfiability Problems with Evolutionary Negative Selection Algorithms
基于进化非选择算法的可满足性问题求解 - Finally, the satisfiability of a SAT problem is verified by the covering of orthogonal clause group on the whole assignment space.
最后，根据正交子句组对整个赋值空间的覆盖情况来判断SAT是否满足。 - Random simulation and binary decision diagrams ( BDDs) as well as Boolean satisfiability ( SAT) are often used as the engines of equivalence checking algorithms together.
为了验证较大规模的电路，通常需要将随机模拟、自动测试生成、二叉判决图、布尔可满足性等多种推理引擎相结合。 - In this paper, an efficient method integrating logic simulation and Boolean satisfiability ( SAT) is presented, which can verify the designs with black boxes.
该文提出了一种结合逻辑模拟和布尔可满足性的黑盒验证方法，用于验证设计中黑盒外部的功能正确性。 - The key reasoning tasks of the semantic Web can be reduced to deciding the satisfiability of formulas.
语义网的关键推理问题可以化为公式的可满足性判定问题。 - Deciding satisfiability of clause set is one of the active research topics in the automated reasoning field.
子句集的可满足性判定是自动证明领域的热点之一。 - Deriving All Minimal Conflict Sets Using Satisfiability Algorithms
使用SAT求解器产生所有极小冲突部件集 - Hybrid Satisfiability Solving for RTL Verification
RTL验证中的混合可满足性求解 - Nowadays there are two popular solutions for Non-Boolean satisfiability problems, one of which is systematic algorithm.
非布尔变量的约束可满足性问题有两种较为普遍的求解方法，系统求解算法就是其中的一种。 - The definitions of syntax structure, semantic interpretation, knowledge base form and reasoning problems based on satisfiability are given for the extended fuzzy description logic.
定义了扩展模糊描述逻辑的语法结构、语义解释、知识库形式以及基于可满足性的推理问题。 - Two heuristic strategies for solving satisfiability ( SAT) problem were presented.
提出了两个用于求解可满足性（SAT）问题的启发式策略。 - In the paper, we describe a efficient algorithm for ATPG& SAT ATPG algorithm based on Satisfiability ( SAT).
本文介绍了可满足性的测试向量生成（SAT-ATPG）算法。 - How to solve the Boolean Satisfiability Problem ( SAT) by genetic algorithms is discussed. The applications of the results for other NP Complete problems are also shown.
讨论了如何利用遗传算法求解布尔表达式的可满足性问题，并给出该结果对求解其他NP完全问题时的应用。 - Formal Verification and ATPG Using Boolean Satisfiability Problems
在形式验证和ATPG中的布尔可满足性问题 - This thesis investigates the decision procedure for checking the satisfiability of Propositional Projection Temporal Logic ( PPTL) and its expressiveness.
本文在研究了命题投影时序逻辑PPTL（PropositionalProjectionTemporalLogic）的语义和语法的基础上，详细阐述了它的判定过程和表达性。 - We use possibility-satisfiability method to solve the model.
给出了解模型的可能-满意度方法（ps法），并用数据进行了实证分析。 - The Analysis of Algorithms for the Propositional Logic Satisfiability Problem
命题逻辑可满足性问题的算法分析 - In the second part we give a game-theoretic characterization for modal mu-calculus's satisfiability problem.
第二部分对模态μ演算上的可满足性问题进行了博弈刻画，对可满足性公式可以进行模型构建，对不可满足公式可以生成反例。 - Solving satisfiability problem by wu's method(ⅰ) algorithm transform
用吴方法求解可满足性问题（Ⅰ）&算法变换 - Using Boolean Satisfiability for Combinational Equivalence Checking
使用布尔可满足性的组合电路等价性验证算法 - A Probabilistic Study on the Satisfiability Problem
可满足性（SAT）问题的概率研究 - SAT problem in classical logic means the satisfiability problem of boolean formulas. it is an essential problem of computer science.
经典逻辑中的SAT问题是指布尔表达式的可满足性问题，它是计算机科学中的核心问题。 - Propositional Satisfiability Problem ( SAT) is a well known problem in computer science and artificial intelligence research.
SAT问题是计算机科学和人工智能研究的领域的著名问题。 - Based on these problems, we present a novel method to translate the software dependency satisfiability identification problem into a CNF-SAT problem, and identify the dependency conflicts by solve the SAT problem.
基于上述不足，本文提出了将软件依赖可满足性识别问题转化为CNF-SAT问题的方法，通过求解CNF-SAT问题，识别软件依赖关系中的冲突。 - Satisfiability ( SAT) problem has been the core problem of research on computational theory.
可满足性问题（SAT）是当代理论计算机科学的核心问题。 - The Satisfiability problem ( SAT) is one of the six basic NP-complete problems. Other NP-complete problems could be transformed into the Satisfiability problem in polynomial time.
可满足性问题是六个基本的NP完全问题之一，其他NP完全问题均可在多项式时间内转换为可满足性问题。 - We study the method of expressing separation of duty constraint 、 qualification constraint of users and enforcement risk constraint in Alloy, discuss the methods of verifying the satisfiability of these constraints and analyzing the degree at which security constraints match security requirement.
研究了在Alloy中表达职责分离约束、用户资质约束和执行风险约束的方法，并讨论了验证这些约束的可满足性、分析与安全需求相匹配程度的方法。