Sciweavers

    JSAT   2006
    Wall of Fame | Most Viewed JSAT-2006 Paper
    JSAT
    2006
    134views more  JSAT 2006»
    Pueblo: A Hybrid Pseudo-Boolean SAT Solver
    13 years 4 months ago
    Pueblo: A Hybrid Pseudo-Boolean SAT Solver
    Download  jsat.ewi.tudelft.nl
    This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
    Hossein M. Sheini, Karem A. Sakallah
    claim paper
    Read More »
    Disclaimer and Copyright Notice
    Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
    IdReadViewsTitleStatus
    1Download preprint from source134
    Pueblo: A Hybrid Pseudo-Boolean SAT Solver
    claim
    2Download preprint from source126
    Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages
    claim
    3Download preprint from source119
    A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length
    claim
    4Download preprint from source114
    Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems
    claim
    5Download preprint from source109
    Decomposing SAT Problems into Connected Components
    claim
    6Download preprint from source108
    Translating Pseudo-Boolean Constraints into SAT
    claim
    7Download preprint from source105
    The First Evaluation of Pseudo-Boolean Solvers (PB'05)
    claim
    8Download preprint from source94
    A Note on the Use of Independent Sets for the k-SAT Problem
    claim
    9Download preprint from source93
    Back to the SAT05 Competition: an a Posteriori Analysis of Solver Performance on Industrial Benchmarks
    claim
    10Download preprint from source92
    A Translation of Pseudo Boolean Constraints to SAT
    claim
    11Download preprint from source91
    Extending Existential Quantification in Conjunctions of BDDs
    claim
    12Download preprint from source88
    On Using Cutting Planes in Pseudo-Boolean Optimization
    claim
    13Download preprint from source87
    Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques
    claim
    14Download preprint from source83
    Report of the Third QBF Solvers Evaluation
    claim
    15Download preprint from source73
    Impurity: Another Phase Transition of SAT
    claim
    16Download preprint from source69
    The SAT 2005 Solver Competition on Random Instances
    claim
    17Download preprint from source68
    Locality and Hard SAT-Instances
    claim
    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.