LEADER 06681nam 22008175 450 001 9910483934703321 005 20251226203552.0 010 $a1-280-00000-7 010 $a9786613560995 010 $a3-642-02777-6 024 7 $a10.1007/978-3-642-02777-2 035 $a(CKB)1000000000753996 035 $a(SSID)ssj0000320379 035 $a(PQKBManifestationID)11270665 035 $a(PQKBTitleCode)TC0000320379 035 $a(PQKBWorkID)10247313 035 $a(PQKB)10373516 035 $a(DE-He213)978-3-642-02777-2 035 $a(MiAaPQ)EBC3064344 035 $a(PPN)136307094 035 $a(EXLCZ)991000000000753996 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheory and Applications of Satisfiability Testing - SAT 2009 $e12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings /$fedited by Oliver Kullmann 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XII, 540 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5584 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-02776-8 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- SAT Modulo Theories: Enhancing SAT with Special-Purpose Algorithms -- Symbolic Techniques in Propositional Satisfiability Solving -- Applications of SAT -- Efficiently Calculating Evolutionary Tree Measures Using SAT -- Finding Lean Induced Cycles in Binary Hypercubes -- Finding Efficient Circuits Using SAT-Solvers -- Encoding Treewidth into SAT -- Complexity Theory -- The Complexity of Reasoning for Fragments of Default Logic -- Does Advice Help to Prove Propositional Tautologies? -- Structures for SAT -- Backdoors in the Context of Learning -- Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences -- On Some Aspects of Mixed Horn Formulas -- Variable Influences in Conjunctive Normal Forms -- Resolution and SAT -- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution -- An Exponential Lower Bound for Width-Restricted Clause Learning -- Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces -- Boundary Points and Resolution -- Translations to CNF -- Sequential Encodings from Max-CSP into Partial Max-SAT -- Cardinality Networks and Their Applications -- New Encodings of Pseudo-Boolean Constraints into CNF -- Efficient Term-ITE Conversion for Satisfiability Modulo Theories -- Techniques for Conflict-Driven SAT Solvers -- On-the-Fly Clause Improvement -- Dynamic Symmetry Breaking by Simulating Zykov Contraction -- Minimizing Learned Clauses -- Extending SAT Solvers to Cryptographic Problems -- Solving SAT by Local Search -- Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability -- A Theoretical Analysis of Search in GSAT -- The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT -- Hybrid SAT Solvers -- A Novel Approach to Combine a SLS- and a DPLL-Solverfor the Satisfiability Problem -- Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques -- Automatic Adaption of SAT Solvers -- Restart Strategy Selection Using Machine Learning Techniques -- Instance-Based Selection of Policies for SAT Solvers -- Width-Based Restart Policies for Clause-Learning Satisfiability Solvers -- Problem-Sensitive Restart Heuristics for the DPLL Procedure -- Stochastic Approaches to SAT Solving -- (1,2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms -- VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search -- QBFs and Their Representations -- Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits -- A Compact Representation for Syntactic Dependencies in QBFs -- Beyond CNF: A Circuit-Based QBF Solver -- Optimisation Algorithms -- Solving (Weighted) Partial MaxSAT through Satisfiability Testing -- Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation? -- Relaxed DPLL Search for MaxSAT -- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates -- Exploiting Cycle Structures in Max-SAT -- Generalizing Core-Guided Max-SAT -- Algorithms for Weighted Boolean Optimization -- Distributed and Parallel Solving -- PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing -- c-sat: A Parallel SAT Solver for Clusters. 330 $aThis book constitutes the refereed proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing, SAT 2009, held in Swansea, UK, in June/July 2009. The 34 revised full papers presented together with 11 revised short papers and 2 invited talks were carefully selected from 86 submissions. The papers are organized in topical sections on applications of SAT, complexity theory, structures for SAT, resolution and SAT, translations to CNF, techniques for conflict-driven SAT Solvers, solving SAT by local search, hybrid SAT solvers, automatic adaption of SAT solvers, stochastic approaches to SAT solving, QBFs and their representations, optimization algorithms, distributed and parallel solving. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5584 606 $aMachine theory 606 $aAlgorithms 606 $aOperating systems (Computers) 606 $aNumerical analysis 606 $aArtificial intelligence 606 $aMathematical logic 606 $aFormal Languages and Automata Theory 606 $aAlgorithms 606 $aOperating Systems 606 $aNumerical Analysis 606 $aArtificial Intelligence 606 $aMathematical Logic and Foundations 615 0$aMachine theory. 615 0$aAlgorithms. 615 0$aOperating systems (Computers). 615 0$aNumerical analysis. 615 0$aArtificial intelligence. 615 0$aMathematical logic. 615 14$aFormal Languages and Automata Theory. 615 24$aAlgorithms. 615 24$aOperating Systems. 615 24$aNumerical Analysis. 615 24$aArtificial Intelligence. 615 24$aMathematical Logic and Foundations. 676 $a005.131 701 $aKullmann$b Oliver$01763066 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483934703321 996 $aTheory and applications of satisfiability testing - SAT 2009$94203316 997 $aUNINA