Theory and Applications of Satisfiability Testing - SAT 2009 (Record no. 181364)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 06208nam a22006135i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-642-02777-2 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240423125744.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 100301s2009 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783642027772 |
| -- | 978-3-642-02777-2 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/978-3-642-02777-2 |
| Source of number or code | doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA267-268.5 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UYA |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | COM014000 |
| Source | bisacsh |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UYA |
| Source | thema |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.131 |
| Edition number | 23 |
| 245 10 - TITLE STATEMENT | |
| Title | Theory and Applications of Satisfiability Testing - SAT 2009 |
| Medium | [electronic resource] : |
| Remainder of title | 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings / |
| Statement of responsibility, etc | edited by Oliver Kullmann. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2009. |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg : |
| -- | Imprint: Springer, |
| -- | 2009. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | XII, 540 p. |
| Other physical details | online resource. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 490 1# - SERIES STATEMENT | |
| Series statement | Theoretical Computer Science and General Issues, |
| International Standard Serial Number | 2512-2029 ; |
| Volume number/sequential designation | 5584 |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Invited 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 ## - SUMMARY, ETC. | |
| Summary, etc | This 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 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Machine theory. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Operating systems (Computers). |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Numerical analysis. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Artificial intelligence. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Mathematical logic. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Formal Languages and Automata Theory. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithms. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Operating Systems. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Numerical Analysis. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Artificial Intelligence. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Mathematical Logic and Foundations. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Kullmann, Oliver. |
| Relator term | editor. |
| Relator code | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY | |
| Title | Springer Nature eBook |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783642027765 |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783642027789 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Theoretical Computer Science and General Issues, |
| -- | 2512-2029 ; |
| Volume number/sequential designation | 5584 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://doi.org/10.1007/978-3-642-02777-2">https://doi.org/10.1007/978-3-642-02777-2</a> |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-SXCS |
| 912 ## - | |
| -- | ZDB-2-LNC |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks-CSE-Springer |
No items available.