SAT'10 accepted papers

      Eli Ben-Sasson and Jan Johannsen. Lower bounds for width-restricted clause learning on small width formulas  
 

      Mladen Nikolic. Statistical Methodology for Comparison of SAT Solvers 
 

      Alexander Nadel and Vadim Ryvchin. Assignment Stack Shrinking 
 

      Stefan Porschen, Tatjana Schmidt and Ewald Speckenmeyer. Complexity Results for Linear XSAT Problems 
 

      Claudia Peschiera, Luca Pulina, Armando Tacchella, Uwe Bubeck, Oliver Kullmann and Ines Lynce. The Seventh QBF Solvers Evaluation (QBFEVAL'10) 
 

      Thomas Hugel and Yacine Boufkhad. Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold 
 

      Vishwambhar Rathi, Erik Aurell, Lars Rasmussen and Mikael Skoglund. Bounds on Threshold of Regular Random $k$-SAT   
 

      Olaf Beyersdorff, Arne Meier, Sebastian Mueller, Michael Thomas and Heribert Vollmer. Proof Complexity of Propositional Default Logic 
 

      Allen Van Gelder and Ivor Spence. Zero-One Designs Produce Small Hard SAT Instances 
 

      Robert Brummayer, Florian Lonsing and Armin Biere. Automated Testing and Debugging of SAT and QBF Solvers 
 

      Oliver Kullmann. Green-Tao Numbers and SAT 
 

      William Klieber, Samir Sapra, Sicun Gao and Edmund Clarke. A Non-Prenex, Non-Clausal QBF Solver with Game-State Learning 
 

      Masaki Yamamoto, Kazuhisa Makino and Suguru Tamaki. An Exact Algorithm for the Boolean Connectivity Problem for k-CNF 
 

      Evgeny Dantsin and Alexander Wolpert. On Moderately Exponential Time for SAT 
 

      Uwe Bubeck and Hans Kleine Büning. Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN 
 

      William Matthews and Ramamohan Paturi. Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable 
 

      Gayathri Namasivayam and Mirosław Truszczynski. Simple but Hard Mixed Horn Formulas 

 

      Rüdiger Ehlers. Minimising Deterministic Büchi Automata Precisely using SAT Solving

 

      Adrian Balint and Andreas Fröhlich. Improving stochastic local search for SAT with instance specific information and a new probability distribution
 

      Florian Lonsing and Armin Biere. Integrating Dependency Schemes in Search-Based QBF Solvers  

 

      Enrico Giunchiglia, Paolo Marin and Massimo Narizzano. sQueezeBF: An effective preprocessor for QBFs based on Equivalence Reasoning 
 

      Matti Järvisalo and Armin Biere. Reconstructing Solutions after Blocked Clause Elimination 
 

      Christian Miller, Stefan Kupferschmid, Matthew Lewis and Bernd Becker. Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs  

 

      Anton Belov and Zbigniew Stachniak. Improved Local Search for Circuit Satisfiability 
 

      Stephan Kottler. SAT Solving with Reference Points 
 

      Miquel Bofill, Josep Suy and Mateu Villaret. A system for solving constraint satisfaction problems with SMT 
 

      Denis Pankratov and Allan Borodin. On the Relative Merits of Simple Local Search Methods for the Max Sat Problem 
 

       Vasco Manquinho, Ruben Martins and Inês Lynce. Improving Unsatisfiability-based Algorithms for Boolean Optimization 

 

       Scott Cotton. Some Techniques for Minimizing Resolution Proofs

 

      Chu-Min LI, Felip Manya, Zhe Quan and Zhu Zhu. Exact MinSAT Solving 
 

      Hadi Katebi, Karem Sakallah and Igor Markov. Symmetry and Satisfiability: An Update 
 

      Dave Tompkins and Holger Hoos. Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT 
 

      Carsten Fuhs and Peter Schneider-Kamp. Synthesizing Shortest Straight-Line Programs over GF(2) using SAT 
 

      Alexandra Goultiaeva and Fahiem Bacchus. Exploiting Circuit Representations in QBF solving 
 

      Ashish Sabharwal, Bart Selman and Lukas Kroc. An Empirical Study of Optimal Noise and Runtime Distributions in Local Search