Theory and Applications of Satisfiability Testing  7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers /  [electronic resource] : 
edited by Holger H. Hoos, David G. Mitchell. 
 - 1st ed. 2005. 
 - XIII, 393 p.  online resource. 
 - Theoretical Computer Science and General Issues,  3542  2512-2029 ; .
 - Theoretical Computer Science and General Issues,  3542 .
<br/><br/>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 SATSolver -- Zchaff2004: An Efficient SAT Solver -- The Second QBF Solvers Comparative Evaluation. 
<br/><br/><label>ISBN: </label>9783540315803 
<br/><br/><label>Standard No.: </label>10.1007/11527695  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Machine theory.<br/>Algorithms.<br/>Operating systems (Computers).<br/>Numerical analysis.<br/>Artificial intelligence.<br/>Mathematical logic.<br/>Formal Languages and Automata Theory.<br/>Algorithms.<br/>Operating Systems.<br/>Numerical Analysis.<br/>Artificial Intelligence.<br/>Mathematical Logic and Foundations.
<br/><br/><label>LC Class. No.: </label>QA267-268.5 
<br/><br/><label>Dewey Class. No.: </label>005.131