satisfiability

基本解釋

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