Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
132
click to vote
SAT
2005
Springer
122
views
Hardware
»
more
SAT 2005
»
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
15 years 8 months ago
Download
sat.inesc-id.pt
We tackle the problem of finding a smallest-cardinality MUS (SMUS) of a given formula. The SMUS provides a succinct explanation of infeasibility and is valuable for applications th...
Maher N. Mneimneh, Inês Lynce, Zaher S. Andr...
claim paper
Read More »