A Scalable Algorithm for Minimal Unsatisfiable Core Extraction

Details A Scalable Algorithm for Minimal Unsatisfiable Core Extraction A Scalable Algorithm for Minimal Unsatisfiable Core Extraction

2006-05-19

arxiv.org/abs/cs/0605085v2

Computer Science

Logic in Computer Science

Scientific paper

We propose a new algorithm for minimal unsatisfiable core extraction, based
on a deeper exploration of resolution-refutation properties. We provide
experimental results on formal verification benchmarks confirming that our
algorithm finds smaller cores than suboptimal algorithms; and that it runs
faster than those algorithms that guarantee minimality of the core.

Affiliated with

Also associated with

No associations

Rating

A Scalable Algorithm for Minimal Unsatisfiable Core Extraction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Scalable Algorithm for Minimal Unsatisfiable Core Extraction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Scalable Algorithm for Minimal Unsatisfiable Core Extraction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-352050