Sciweavers

    SAT
    2005
    Springer
    122views Hardware» more  SAT 2005»
    A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
    13 years 10 months ago
    A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
    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 »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.