Ofer Strichman

Theory and Applications of Satisfiability Testing - SAT 2010: 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010, Proceedings - Theoretical Computer Science and General Issues Ofer Strichman 2010 edition

Marc Notes: Includes bibliographical references and index. Table of Contents: Part 1. Invited Talks -- The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference / Yehuda Naveh -- Exact Algorithms and Complexity / Ramamohan Paturi -- Part 2. Regular Papers -- Improving Stochastic Local Search for SAT with a New Probability Distribution / Adrian Balint, Andreas FrOhlich -- Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas / Eli Ben-Sasson, Jan Johannsen -- Proof Complexity of Propositional Default Logic / Olaf Beyersdorff, Arne Meier, Sebastian MUller, Michael Thomas, Heribert Vollmer -- Automated Testing and Debugging of SAT and QBF Solvers / Robert Brummayer, Florian Lonsing, Armin Biere -- Rewriting (Dependency-) Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN / Uwe Bubeck, Hans Kleine BUning -- Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT / Carsten Fuhs, Peter Schneider-Kamp -- sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning / Enrico Giunchiglia, Paolo Marin, Massimo Narizzano -- Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold / Yacine Boufkhad, Thomas Hugel -- Symmetry and Satisfiability: An Update / Hadi Katebi, Karem A. Sakallah, Igor L. Markov -- A Non-prenex, Non-clausal QBF Solver with Game-State Learning / William Klieber, Samir Sapra, Sicun Gao, Edmund Clarke -- SAT Solving with Reference Points / Stephan Kottler -- Integrating Dependency Schemes in Search-Based QBF Solvers / Florian Lonsing, Armin Biere -- An Exact Algorithm for the Boolean Connectivity Problem for k-CNF / Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto -- Improving Unsatisfiability-Based Algorithms for Boolean Optimization / Vasco Manquinho, Ruben Martins, InEs Lynce -- Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs / Christian Miller, Stefan Kupferschmid, Matthew Lewis, Bernd Becker -- Statistical Methodology for Comparison of SAT Solvers / Mladen Nikolic -- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem / Denis Pankratov, Allan Borodin -- The Seventh QBF Solvers Evaluation (QBFEVAL'10) / Claudia Peschiera, Luca Pulina, Armando Tacchella, Uwe Bubeck, Oliver Kullmann, InEs Lynce -- Complexity Results for Linear XSAT-Problems / Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer -- Bounds on Threshold of Regular Random k-SAT / Vishwambhar Rathi, Erik Aurell, Lars Rasmussen, Mikael Skoglund -- Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT / Dave A. D. Tompkins, Holger H. Hoos -- Part 3. Short Papers -- Improved Local Search for Circuit Satisfiability / Anton Belov, Zbigniew Stachniak -- A System for Solving Constraint Satisfaction Problems with SMT / Miquel Bofil, Josep Suy, Mateu Villaret -- Two Techniques for Minimizing Resolution Proofs / Scott Cotton -- On Moderately Exponential Time for SAT / Evgeny Dantsin, Alexander Wolpert -- Minimising Deterministic BUchi Automata Precisely Using SAT Solving / RUdiger Ehlers -- Exploiting Circuit Representations in QBF solving / Alexandra Goultiaeva, Fahiem Bacchus -- Reconstructing Solutions after Blocked Clause Elimination / Matti JArvisalo, Armin Biere -- An Empirical Study of Optimal Noise and Runtime Distributions in Local Search / Lukas Kroc, Ashish Sabharwal, Bart Selman -- Green-Tao Numbers and SAT / Oliver Kullmann -- Exact MinSAT Solving / Chu Min Li, Felip ManyA, Zhe Quan, Zhu Zhu -- Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable / William Matthews, Ramamohan Paturi -- Assignment Stack Shrinking / Alexander Nadel, Vadim Ryuchin -- Simple but Hard Mixed Horn Formulas / Gayathri Namasivayam, Miroslaw Truszczynski -- Zero-One Designs Produce Small Hard SAT Instances / Allen Van Gelder, Ivor Spence -- Author Index.