Applying CNF simplification techniques for SAT-based...

Details Applying CNF simplification techniques for SAT-based... Applying CNF simplification techniques for SAT-based...

2008-03-31

2008-10-21

Dinh, Paul (Department: 2825)

Computer-aided design and analysis of circuits and semiconductor

Nanotechnology related integrated circuit design

C716S030000, C716S030000, C716S030000

Reexamination Certificate

active

07441216

ABSTRACT:
The present embodiment keeps track of a set of resolution required for generating each one of the clauses added by the simplification method. This information is used by the method that generates the unsat core in order to extract the original clauses that generated the simplified clauses. This work integrates resolution based CNF simplification technique inside the SAT-based abstraction refinement scheme in a unique way that overcomes the difficulties.

REFERENCES:
patent: 7302656 (2007-11-01), Weber et al.
patent: 2002/0095645 (2002-07-01), Rodeh
patent: 2003/0110455 (2003-06-01), Baumgartner et al.
patent: 2004/0153308 (2004-08-01), McMillan et al.
patent: 2004/0230407 (2004-11-01), Gupta et al.
patent: 2005/0166167 (2005-07-01), Ivancic et al.
patent: 2006/0129959 (2006-06-01), Mang et al.
patent: 2006/0190864 (2006-08-01), Ganai et al.
patent: 2007/0174799 (2007-07-01), Baumgartner et al.
patent: 2008/0092093 (2008-04-01), Balakrishnan et al.

Affiliated with

Also associated with

Rating

Applying CNF simplification techniques for SAT-based... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Applying CNF simplification techniques for SAT-based..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Applying CNF simplification techniques for SAT-based... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4010023