ITERATIVE ABSTRACTION USING SAT-BASED BMC WITH PROOF ANALYSIS

Patent №

US 7,742,907

Granted

2010-06-22

Filed 2004

Owner

NEC LABORATORIES AMERICA, INC.

Lab

AI components

2

kr · hardware

Assignment

Recorded

Dataset

AIPD

2023_r1 edition

Application

10762499

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.

AI classification

Knowledge representation1.00
AI hardware0.97
Evolutionary computation0.00
Natural language0.00
Vision0.00
Machine learning0.00
Speech0.00
Planning0.00

Ownership

NEC LABORATORIES AMERICA, INC.

assignment · 147590160

Assignors

GUPTA, AARTI, GANAI, MALAY, YANG, ZIJIANG, ASHAR, PRANAV

On an employer assignment, the assignors are typically the inventors.

© 2026 NYSGPT2525 LLC