Theory and applications of satisfiability testing - SAT 2006 : 9th international conference, Seattle, WA, USA, August 12-15, 2006, proceedings
著者
書誌事項
Theory and applications of satisfiability testing - SAT 2006 : 9th international conference, Seattle, WA, USA, August 12-15, 2006, proceedings
(Lecture notes in computer science, 4121)
Springer, 2006
大学図書館所蔵 全8件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical reference and index
内容説明・目次
内容説明
This 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.
目次
Invited 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 Clause Density 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.
「Nielsen BookData」 より