000 06208nam a22006135i 4500
001 978-3-642-02777-2
003 DE-He213
005 20240423125744.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642027772
_9978-3-642-02777-2
024 7 _a10.1007/978-3-642-02777-2
_2doi
050 4 _aQA267-268.5
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.131
_223
245 1 0 _aTheory and Applications of Satisfiability Testing - SAT 2009
_h[electronic resource] :
_b12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings /
_cedited by Oliver Kullmann.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aXII, 540 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5584
505 0 _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.
520 _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.
650 0 _aMachine theory.
650 0 _aAlgorithms.
650 0 _aOperating systems (Computers).
650 0 _aNumerical analysis.
650 0 _aArtificial intelligence.
650 0 _aMathematical logic.
650 1 4 _aFormal Languages and Automata Theory.
650 2 4 _aAlgorithms.
650 2 4 _aOperating Systems.
650 2 4 _aNumerical Analysis.
650 2 4 _aArtificial Intelligence.
650 2 4 _aMathematical Logic and Foundations.
700 1 _aKullmann, Oliver.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642027765
776 0 8 _iPrinted edition:
_z9783642027789
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5584
856 4 0 _uhttps://doi.org/10.1007/978-3-642-02777-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c181364
_d181364