AMUSE: a minimally-unsatisfiable subformula extractor

doi:10.1145/996566.996710

AMUSE: a minimally-unsatisfiable subformula extractor

Full Text:

PDF

Buy this Article

Authors:	Yoonna Oh	University of Michigan, Ann Arbor, MI
	Maher N. Mneimneh	University of Michigan, Ann Arbor, MI
	Zaher S. Andraus	University of Michigan, Ann Arbor, MI
	Karem A. Sakallah	University of Michigan, Ann Arbor, MI
	Igor L. Markov	University of Michigan, Ann Arbor, MI

	2004 Article
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 18 · Downloads (cumulative): 234 · Citation Count: 42

Published in:

	· Proceeding
	DAC '04 Proceedings of the 41st annual Design Automation Conference
	Pages 518-523 ACM New York, NY, USA ©2004 table of contents ISBN:1-58113-828-8 doi>10.1145/996566.996710

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- DAC '13

Share:

|

Tags: algorithms boolean satisfiability combinatorial algorithms conjunctive normal form diagnosis minimally-unsatisfiable subformula verification

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder