LEADER 01309nam 2200385 450 001 9910806850903321 005 20230725030140.0 010 $a3-7369-3310-X 035 $a(CKB)4340000000198472 035 $a(MiAaPQ)EBC5020510 035 $a(EXLCZ)994340000000198472 100 $a20171005h20102010 uy 0 101 0 $ager 135 $aurcnu|||||||| 181 $2rdacontent 182 $2rdamedia 183 $2rdacarrier 200 10$aLuftfracht als wettbewerbsfaktor des wirtschaftsstandortes Schweiz $ezur sta?rkung der Schweizer wirtschaft und zur sicherung hochwertiger arbeitspla?tze im Inland /$fJoachim Ehrenthal, Joerg S. Hofstetter, Wolfgang Sto?lzle 205 $a1. Auflage. 210 1$aGo?ttingen, [Germany] :$cCuvillier Verlag,$d2010. 210 4$dİ2010 215 $a1 online resource (101 pages) $cillustrations (some color) 311 $a3-86955-310-3 607 $aSwitzerland$xEconomic conditions 676 $a330.9494 700 $aEhrenthal$b Joachim$01612309 702 $aHofstetter$b Joerg S. 702 $aSto?lzle$b Wolfgang 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910806850903321 996 $aLuftfracht als wettbewerbsfaktor des wirtschaftsstandortes Schweiz$93941028 997 $aUNINA LEADER 05858nam 22008295 450 001 9910484504903321 005 20251226203005.0 010 $a3-540-37207-5 024 7 $a10.1007/11814948 035 $a(CKB)1000000000233065 035 $a(SSID)ssj0000320377 035 $a(PQKBManifestationID)11937782 035 $a(PQKBTitleCode)TC0000320377 035 $a(PQKBWorkID)10249485 035 $a(PQKB)10621572 035 $a(DE-He213)978-3-540-37207-3 035 $a(MiAaPQ)EBC3068209 035 $a(PPN)123137209 035 $a(BIP)34164177 035 $a(BIP)13552799 035 $a(EXLCZ)991000000000233065 100 $a20100301d2006 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheory and Applications of Satisfiability Testing - SAT 2006 $e9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings /$fedited by Armin Biere, Carla P. Gomes 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XII, 440 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4121 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-37206-7 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- From Propositional Satisfiability to Satisfiability Modulo Theories -- CSPs: Adding Structure to SAT -- Session 1. Proofs and Cores -- Complexity of Semialgebraic Proofs with Restricted Degree of Falsity -- Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel -- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction -- Minimum Witnesses for Unsatisfiable 2CNFs -- Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs -- Extended Resolution Proofs for Symbolic SAT Solving with Quantification -- Session 2. Heuristics and Algorithms -- Encoding CNFs to Empower Component Analysis -- Satisfiability Checking of Non-clausal Formulas Using General Matings -- Determinization of Resolution by an Algorithm Operating on Complete Assignments -- A Complete Random Jump Strategy with Guiding Paths -- Session 3. Applications -- Applications of SAT Solvers to Cryptanalysis of Hash Functions -- Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies -- Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ -- SAT in Bioinformatics: Making the Case with Haplotype Inference -- Session 4. SMT -- Lemma Learning in SMT on Linear Constraints -- On SAT Modulo Theories and Optimization Problems -- Fast and Flexible Difference Constraint Propagation for DPLL(T) -- A Progressive Simplifier for Satisfiability Modulo Theories -- Session 5. Structure -- Dependency Quantified Horn Formulas: Models and Complexity -- On Linear CNF Formulas -- A Dichotomy Theorem for Typed Constraint Satisfaction Problems -- Session 6. MAX-SAT -- A Complete Calculus for Max-SAT -- On Solving the Partial MAX-SAT Problem -- MAX-SAT for Formulas with Constant ClauseDensity Can Be Solved Faster Than in Time -- Average-Case Analysis for the MAX-2SAT Problem -- Session 7. Local Search and Survey Propagation -- Local Search for Unsatisfiability -- Efficiency of Local Search -- Implementing Survey Propagation on Graphics Processing Units -- Characterizing Propagation Methods for Boolean Satisfiability -- Session 8. QBF -- Minimal False Quantified Boolean Formulas -- Binary Clause Reasoning in QBF -- Solving Quantified Boolean Formulas with Circuit Observability Don?t Cares -- QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency -- Session 9. Counting and Concurrency -- Solving #SAT Using Vertex Covers -- Counting Models in Integer Domains -- sharpSAT ? Counting Models with Advanced Component Caching and Implicit BCP -- A Distribution Method for Solving SAT in Grids. 330 $aThis book constitutes the refereed proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing, SAT 2006. The book presents 26 revised full papers together with 11 revised short papers and 2 invited talks. Coverage extends to all current research issues in propositional and quantified Boolean formula satisfiability testing. The papers are organized in topical sections on proofs and cores, heuristics and algorithms, and more. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4121 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 $a511.3 701 $aBiere$b Armin$01193224 701 $aGomes$b Carla$01758413 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484504903321 996 $aTheory and applications of satisfiability testing--SAT 2006$94196611 997 $aUNINA