LEADER 03939nam 2200613 a 450 001 9910484593503321 005 20200520144314.0 010 $a3-540-31580-2 024 7 $a10.1007/11527695 035 $a(CKB)1000000000232415 035 $a(SSID)ssj0000320380 035 $a(PQKBManifestationID)11238879 035 $a(PQKBTitleCode)TC0000320380 035 $a(PQKBWorkID)10247314 035 $a(PQKB)11619008 035 $a(DE-He213)978-3-540-31580-3 035 $a(MiAaPQ)EBC3068404 035 $a(PPN)123096219 035 $a(EXLCZ)991000000000232415 100 $a20050608d2005 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheory and applications of satisfiability testing $e7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004 : revised selected papers /$fHolger H. Hoos, David G. Mitchell (eds.) 205 $a1st ed. 2005. 210 $aBerlin $cSpringer$d2005 215 $a1 online resource (XIII, 393 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v3542 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-27829-X 320 $aIncludes bibliographical references and index. 327 $aMapping Problems with Finite-Domain Variables to Problems with Boolean Variables -- Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables -- A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints -- An Algebraic Approach to the Complexity of Generalized Conjunctive Queries -- Incremental Compilation-to-SAT Procedures -- Resolve and Expand -- Looking Algebraically at Tractable Quantified Boolean Formulas -- Derandomization of Schuler?s Algorithm for SAT -- Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank -- QBF Reasoning on Real-World Instances -- Automatic Extraction of Functional Dependencies -- Algorithms for Satisfiability Using Independent Sets of Variables -- Aligning CNF- and Equivalence-Reasoning -- Using DPLL for Efficient OBDD Construction -- Approximation Algorithm for Random MAX-kSAT -- Clause Form Conversions for Boolean Circuits -- From Spin Glasses to Hard Satisfiable Formulas -- CirCUs: A Hybrid Satisfiability Solver -- Equivalence Models for Quantified Boolean Formulas -- Search vs. Symbolic Techniques in Satisfiability Solving -- Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems -- Satisfiability Threshold of the Skewed Random k-SAT -- NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances -- Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems -- UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT -- SAT Solver Competition and QBF Solver Evaluation (Invited Papers) -- Fifty-Five Solvers in Vancouver: The SAT 2004 Competition -- March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver -- Zchaff2004: An Efficient SAT Solver -- The Second QBF Solvers Comparative Evaluation. 410 0$aLecture notes in computer science ;$v3542. 517 3 $aSAT 2004 606 $aPropositional calculus$vCongresses 606 $aAlgebra, Boolean$vCongresses 606 $aComputer algorithms$vCongresses 606 $aDecision making$vCongresses 615 0$aPropositional calculus 615 0$aAlgebra, Boolean 615 0$aComputer algorithms 615 0$aDecision making 676 $a511.3 701 $aHoos$b Holger H$01657174 701 $aMitchell$b David G.$cPh. D.$01757084 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484593503321 996 $aTheory and applications of satisfiability testing$94194730 997 $aUNINA