03939nam 2200613 a 450 991048459350332120200520144314.03-540-31580-210.1007/11527695(CKB)1000000000232415(SSID)ssj0000320380(PQKBManifestationID)11238879(PQKBTitleCode)TC0000320380(PQKBWorkID)10247314(PQKB)11619008(DE-He213)978-3-540-31580-3(MiAaPQ)EBC3068404(PPN)123096219(EXLCZ)99100000000023241520050608d2005 uy 0engurnn|008mamaatxtccrTheory and applications of satisfiability testing 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004 : revised selected papers /Holger H. Hoos, David G. Mitchell (eds.)1st ed. 2005.Berlin Springer20051 online resource (XIII, 393 p.) Lecture notes in computer science,0302-9743 ;3542Bibliographic Level Mode of Issuance: Monograph3-540-27829-X Includes bibliographical references and index.Mapping 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.Lecture notes in computer science ;3542.SAT 2004Propositional calculusCongressesAlgebra, BooleanCongressesComputer algorithmsCongressesDecision makingCongressesPropositional calculusAlgebra, BooleanComputer algorithmsDecision making511.3Hoos Holger H1657174Mitchell David G.Ph. D.1757084MiAaPQMiAaPQMiAaPQBOOK9910484593503321Theory and applications of satisfiability testing4194730UNINA