可滿足性

The satisfiability problem of conjunction normal form (abbreviate SAT problem) is an NP_complete problem. 合取范式可滿足性問題(簡(jiǎn)稱SAT問題)是一個(gè)NP完全問題。

The satisfiability problem is a key problem in computer science and artificial intelligence. 這是計(jì)算機(jī)科學(xué)和人工智能中的重要問題之一。

The research of this paper is based on the Boolean Satisfiability (SAT) Problem of combinational circuit. 本文研究工作是針對(duì)可滿足問題（SAT）在組合電路驗(yàn)證和測(cè)試中的應(yīng)用展開的。

Binary decision diagram (BDD) and Boolean sat satisfiability (SAT) are common techniques of logic circuit-based Boolean reasoning scheme. 摘要在基于邏輯電路的布爾推理過程中，經(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)目還研究了邏輯公式的可滿足性判定問題。

In recent years, the Boolean Satisfiability (SAT) Problem, which is a foundational problem of verification, has made a great advance. 本文分析了現(xiàn)有的電路可滿足性驗(yàn)證工具的優(yōu)缺點(diǎn)，針對(duì)驗(yàn)證中學(xué)習(xí)效率的瓶頸提出了改進(jìn)的方法，能夠更加合理地利用電路現(xiàn)有的信息。