公开(公告)号：US20040230407A1

公开(公告)日：2004-11-18

申请号：US10762499

申请日：2004-01-23

Applicant: NEC LABORATORIES AMERICA, INC

Inventor： Aarti Gupta ,  Malay Ganai ,  Zijiang Yang ,  Pranav Ashar

IPC: G06F007/60

CPC classification number: G06F17/504

Abstract: A method of obtaining a resolution-based proof of unsatisfiability using a SAT procedure for a hybrid Boolean constraint problem comprising representing constraints as a combination of clauses and interconnected gates. The proof is obtained as a combination of clauses, circuit gates and gate connectivity constraints sufficient for unsatisfiability.

Abstract translation: 使用针对混合布尔约束问题的SAT过程获得基于分辨率的不满足证明的方法，包括将约束表示为子句和互连门的组合。 证明是作为条件，电路门和门连接约束的组合获得的，足以满足不满足性。

公开(公告)号：US20040210860A1

公开(公告)日：2004-10-21

申请号：US10795384

申请日：2004-03-09

Applicant: NEC LABORATORIES AMERICA, INC

Inventor： Malay Ganai ,  Aarti Gupta ,  Zijiang Yang ,  Pranav Ashar

IPC: G06F017/50

CPC classification number: G06F17/504

Abstract: There is provided a method of solving a SAT problem comprising partitioning SAT-formula clauses in the SAT problem into a plurality of partitions. Each of said plurality of partitions is solved as a separate process each, thereby constituting a plurality of processes where each of said process communicates only with a subset of the plurality of processes.

Abstract translation: 提供了一种解决SAT问题的方法，包括将SAT问题中的SAT公式子句分成多个分区。 所述多个分区中的每一个分别被解决为单独的处理，从而构成多个处理，其中每个所述进程仅与多个进程的子集进行通信。