Theory and Applications of Satisfiability Testing - SAT 2010: 13th International Conference, SAT 2010, Edinburgh, Uk, July 11-14, 2010, Proceedings

ISBN-13: 9783642141850 / Angielski / Miękka / 2010 / 400 str.

Ofer Strichman; Stefan Szeider

Opis

This volume contains the papers presented at SAT 2010, the 13th International Conference on Theory and Applications of Satis?ability Testing. SAT 2010 was held as part of the 2010 Federated Logic Conference (FLoC) and was hosted by the School of Informatics at the University of Edinburgh, Scotland. In addition to SAT, FLoC included the conferences CAV, CSF, ICLP, IJCAR, ITP, LICS, RTA, as well as over 50 workshops. A?liated with SAT were the workshops LaSh (Logic and Search, co-a?liated with ICLP), LoCoCo (Logics for C- ponent Con?guration), POS (Pragmatics Of SAT), PPC (Propositional Proof Complexity: Theory and Practice), and SMT (Satis?ability Modulo Theories, co-a?liated with CAV). SAT featured three competitions: the MAX-SAT Ev- uation 2010, the Pseudo-Boolean Competition 2010, and the SAT-Race 2010. Many hard combinatorial problems such as problems arising in veri?cation and planning can be naturally expressed within the framework of propositional satis?ability. Due to its wide applicability and enormous progress in the perf- mance of solving methods, satis?ability has become one of today's most imp- tant core technologies. The SAT 2010 call for papers invited the submission of original practical and theoretical research on satis?ability. Topics included but were not limited to proof systems and proof complexity, search algorithms and heuristics, analysis of algorithms, combinatorial theory of satis?ability, random instances vs structured instances, problem encodings, industrial applications, applicationsto combinatorics,solvers,simpli?ers andtools,casestudies and- piricalresults,exactandparameterizedalgorithms.

Spis treści

1. Invited Talks.- The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference.- Exact Algorithms and Complexity.- 2. Regular Papers.- Improving Stochastic Local Search for SAT with a New Probability Distribution.- Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas.- Proof Complexity of Propositional Default Logic.- Automated Testing and Debugging of SAT and QBF Solvers.- Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN.- Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT.- sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning.- Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold.- Symmetry and Satisfiability: An Update.- A Non-prenex, Non-clausal QBF Solver with Game-State Learning.- SAT Solving with Reference Points.- Integrating Dependency Schemes in Search-Based QBF Solvers.- An Exact Algorithm for the Boolean Connectivity Problem for k-CNF.- Improving Unsatisfiability-Based Algorithms for Boolean Optimization.- Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs.- Statistical Methodology for Comparison of SAT Solvers.- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem.- The Seventh QBF Solvers Evaluation (QBFEVAL’10).- Complexity Results for Linear XSAT-Problems.- Bounds on Threshold of Regular Random k-SAT.- Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT.- 3. Short Papers.- Improved Local Search for Circuit Satisfiability.- A System for Solving Constraint Satisfaction Problems with SMT.- Two Techniques for Minimizing Resolution Proofs.- On Moderately Exponential Time for SAT.- Minimising Deterministic Büchi Automata Precisely Using SAT Solving.- Exploiting Circuit Representations in QBF Solving.- Reconstructing Solutions after Blocked Clause Elimination.- An Empirical Study of Optimal Noise and Runtime Distributions in Local Search.- Green-Tao Numbers and SAT.- Exact MinSAT Solving.- Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable.- Assignment Stack Shrinking.- Simple but Hard Mixed Horn Formulas.- Zero-One Designs Produce Small Hard SAT Instances.