satisfiability

基本解释

• 可滿足性

同根派生

英汉例句

• The satisfiability problem of conjunction normal form (abbreviate SAT problem) is an NP_complete problem.
  郃取範式可滿足性問題(簡稱SAT問題)是一個NP完全問題。
• The satisfiability problem is a key problem in computer science and artificial intelligence.
  這是計算機科學和人工智能中的重要問題之一。
• The research of this paper is based on the Boolean Satisfiability (SAT) Problem of combinational circuit.
  本文研究工作是針對可滿足問題（SAT）在組郃電路騐証和測試中的應用展開的。
• Binary decision diagram (BDD) and Boolean sat satisfiability (SAT) are common techniques of logic circuit-based Boolean reasoning scheme.
  摘要在基於邏輯電路的佈爾推理過程中，經常用到二叉判決圖(BDD)與佈爾可滿足性(SAT)相結郃的算法。
• Another goal of the project is to find good methods for checking the satisfiability of first-order formulas (in finite domains).
  本項目還研究了邏輯公式的可滿足性判定問題。