Is the SAT_ALL algorithm published in DAC'05 implemented in current VIS release?

From: Li, Lun (lli_at_mail.smu.edu)
Date: Tue Aug 30 2005 - 09:18:43 MDT

• Next message: Srikanth Reddy G: "problem with vis"
• Previous message: Bing.Li_at_colorado.edu: "Fwd: Re: Help on error "# BMC: SAT Solver failed, try again" when runing arbiter example"
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
• Mail actions: [ respond to this message ] [ mail a new topic ]

Thanks ahead,

I was wondering if the algorithm in the paper "Prime Clauses for Fast Enumeration of Satisfying Assignments to Boolean Circuits" (Dac'05) is in current VIS-2.1 release. If yes, how to invoke the algorithm?

Best regards,

Lun

• application/ms-tnef attachment: winmail.dat

• Next message: Srikanth Reddy G: "problem with vis"
• Previous message: Bing.Li_at_colorado.edu: "Fwd: Re: Help on error "# BMC: SAT Solver failed, try again" when runing arbiter example"
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
• Mail actions: [ respond to this message ] [ mail a new topic ]

This archive was generated by hypermail 2.1.7 : Tue Aug 30 2005 - 09:24:50 MDT