Theory And Applications of Satisfiability Testing - Sat 2006: 9th International Conference, Seattle, Wa, Usa, August 12-15, 2006, Proceedings

by Biere, Armin; Gomes, Carla P.

• ISBN13: 9783540372066
• ISBN10: 3540372067
• Format: Paperback
• Copyright: 2006-09-15
• Publisher: Springer Verlag

Summary

This book constitutes the refereed proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing, SAT 2006, held in Seattle, WA, USA in August 2006 as part of the 4th Federated Logic Conference, FLoC 2006.The 26 revised full papers presented together with 11 revised short papers presented together with 2 invited talks were carefully selected from 95 submissions. All current research issues in propositional and quantified Boolean formula satisfiability testing are covered; the papers are organized in topical sections on proofs and cores, heuristics and algorithms, applications, SMT, structure, MAX-SAT, local search and survey propagation, QBF, as well as counting and concurrency.

Table of Contents

Invited Talks
From Propositional Satisfiability to Satisfiability Modulo Theories	p. 1
CSPs: Adding Structure to SAT	p. 10
Proofs and Cores
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity	p. 11
Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel	p. 22
A Scalable Algorithm for Minimal Unsatisfiable Core Extraction	p. 36
Minimum Witnesses for Unsatisfiable 2CNFs	p. 42
Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs	p. 48
Extended Resolution Proofs for Symbolic SAT Solving with Quantification	p. 54
Heuristics and Algorithms
Encoding CNFs to Empower Component Analysis	p. 61
Satisfiability Checking of Non-clausal Formulas Using General Matings	p. 75
Determinization of Resolution by an Algorithm Operating on Complete Assignments	p. 90
A Complete Random Jump Strategy with Guiding Paths	p. 96
Applications
Applications of SAT Solvers to Cryptanalysis of Hash Functions	p. 102
Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies	p. 116
Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ALC	p. 130
SAT in Bioinformatics: Making the Case with Haplotype Inference	p. 136
SMT
Lemma Learning in SMT on Linear Constraints	p. 142
On SAT Modulo Theories and Optimization Problems	p. 156
Fast and Flexible Difference Constraint Propagation for DPLL(T)	p. 170
A Progressive Simplifier for Satisfiability Modulo Theories	p. 184
Structure
"Dependency Quantified Horn Formulas: Models and Complexity	p. 198
On Linear CNF Formulas	p. 212
A Dichotomy Theorem for Typed Constraint Satisfaction Problems	p. 226
Max-SAT
A Complete Calculus for Max-SAT	p. 240
On Solving the Partial Max-Sat Problem	p. 252
Max-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(2n) Time	p. 266
Average-Case Analysis for the Max-2SAT Problem	p. 277
Local Search and Survey Propagation
Local Search for Unsatisfiability	p. 283
Efficiency of Local Search	p. 297
Implementing Survey Propagation on Graphics Processing Units	p. 311
Characterizing Propagation Methods for Boolean Satisfiability	p. 325
QBF
Minimal False Quantified Boolean Formulas	p. 339
Binary Clause Reasoning in QBF	p. 353
Solving Quantified Boolean Formulas with Circuit Observability Don't Cares	p. 368
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency	p. 382
Counting and Concurrency
Solving #SAT Using Vertex Covers	p. 396
Counting Models in Integer Domains	p. 410
SharpSAT - Counting Models with Advanced Component Caching and Implicit BCP	p. 424
A Distribution Method for Solving SAT in Grids	p. 430
Author Index	p. 437
Table of Contents provided by Ingram. All Rights Reserved.