12. SAT 2010:
Edinburgh,
UK
Ofer Strichman, Stefan Szeider (Eds.):
Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings.
Lecture Notes in Computer Science 6175 Springer 2010, ISBN 978-3-642-14185-0 
Invited Talks
- Yehuda Naveh:
The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference.
1-7
- Ramamohan Paturi:
Exact Algorithms and Complexity.
8-9
Regular Papers
- Adrian Balint, Andreas Fröhlich:
Improving Stochastic Local Search for SAT with a New Probability Distribution.
10-15
- Eli Ben-Sasson, Jan Johannsen:
Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas.
16-29
- Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof Complexity of Propositional Default Logic.
30-43
- Robert Brummayer, Florian Lonsing, Armin Biere:
Automated Testing and Debugging of SAT and QBF Solvers.
44-57
- Uwe Bubeck, Hans Kleine Büning:
Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN.
58-70
- Carsten Fuhs, Peter Schneider-Kamp:
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT.
71-84
- Enrico Giunchiglia, Paolo Marin, Massimo Narizzano:
sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning.
85-98
- Yacine Boufkhad, Thomas Hugel:
Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold.
99-112
- Hadi Katebi, Karem A. Sakallah, Igor L. Markov:
Symmetry and Satisfiability: An Update.
113-127
- William Klieber, Samir Sapra, Sicun Gao, Edmund M. Clarke:
A Non-prenex, Non-clausal QBF Solver with Game-State Learning.
128-142
- Stephan Kottler:
SAT Solving with Reference Points.
143-157
- Florian Lonsing, Armin Biere:
Integrating Dependency Schemes in Search-Based QBF Solvers.
158-171
- Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
An Exact Algorithm for the Boolean Connectivity Problem for k-CNF.
172-180
- Vasco M. Manquinho, Ruben Martins, Inês Lynce:
Improving Unsatisfiability-Based Algorithms for Boolean Optimization.
181-193
- Christian Miller, Stefan Kupferschmid, Matthew D. T. Lewis, Bernd Becker:
Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs.
194-208
- Mladen Nikolic:
Statistical Methodology for Comparison of SAT Solvers.
209-222
- Denis Pankratov, Allan Borodin:
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem.
223-236
- Claudia Peschiera, Luca Pulina, Armando Tacchella, Uwe Bubeck, Oliver Kullmann, Inês Lynce:
The Seventh QBF Solvers Evaluation (QBFEVAL'10).
237-250
- Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer:
Complexity Results for Linear XSAT-Problems.
251-263
- Vishwambhar Rathi, Erik Aurell, Lars K. Rasmussen, Mikael Skoglund:
Bounds on Threshold of Regular Random k-SAT.
264-277
- Dave A. D. Tompkins, Holger H. Hoos:
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT.
278-292
Short Papers
- Anton Belov, Zbigniew Stachniak:
Improved Local Search for Circuit Satisfiability.
293-299
- Miquel Bofill, Josep Suy, Mateu Villaret:
A System for Solving Constraint Satisfaction Problems with SMT.
300-305
- Scott Cotton:
Two Techniques for Minimizing Resolution Proofs.
306-312
- Evgeny Dantsin, Alexander Wolpert:
On Moderately Exponential Time for SAT.
313-325
- Rüdiger Ehlers:
Minimising Deterministic Büchi Automata Precisely Using SAT Solving.
326-332
- Alexandra Goultiaeva, Fahiem Bacchus:
Exploiting Circuit Representations in QBF Solving.
333-339
- Matti Järvisalo, Armin Biere:
Reconstructing Solutions after Blocked Clause Elimination.
340-345
- Lukas Kroc, Ashish Sabharwal, Bart Selman:
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search.
346-351
- Oliver Kullmann:
Green-Tao Numbers and SAT.
352-362
- Chu Min Li, Felip Manyà, Zhe Quan, Zhu Zhu:
Exact MinSAT Solving.
363-368
- William Matthews, Ramamohan Paturi:
Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable.
369-374
- Alexander Nadel, Vadim Ryvchin:
Assignment Stack Shrinking.
375-381
- Gayathri Namasivayam, Miroslaw Truszczynski:
Simple but Hard Mixed Horn Formulas.
382-387
- Allen Van Gelder, Ivor Spence:
Zero-One Designs Produce Small Hard SAT Instances.
388-397
Last update Fri May 25 08:35:22 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
