Ofer Strichman, Stefan Szeider
Proceedings of the 13th International Conference on Theory and Applications of Satisfiability Testing
SAT, 2010.

@proceedings{SAT-2010,
	address       = "Edinburgh, Scotland, United Kingdom",
	doi           = "10.1007/978-3-642-14186-7",
	editor        = "Ofer Strichman and Stefan Szeider",
	isbn          = "978-3-642-14185-0",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 13th International Conference on Theory and Applications of Satisfiability Testing}",
	volume        = 6175,
	year          = 2010,
}

Contents (37 items)

18 ×#satisfiability
4 ×#bound
4 ×#problem
3 ×#algorithm
3 ×#complexity
2 ×#constraints
2 ×#design
2 ×#learning
2 ×#linear
2 ×#on the

SAT-2010-Naveh #constraints #difference

The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference (YN), pp. 1–7.

SAT-2010-Paturi #algorithm #complexity

Exact Algorithms and Complexity (RP), pp. 8–9.

SAT-2010-BalintF #probability #satisfiability

Improving Stochastic Local Search for SAT with a New Probability Distribution (AB, AF), pp. 10–15.

SAT-2010-Ben-SassonJ #bound #learning #strict

Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas (EBS, JJ), pp. 16–29.

SAT-2010-BeyersdorffMMTV #complexity #logic #proving

Proof Complexity of Propositional Default Logic (OB, AM, SM, MT, HV), pp. 30–43.

SAT-2010-BrummayerLB #automation #debugging #satisfiability #testing

Automated Testing and Debugging of SAT and QBF Solvers (RB, FL, AB), pp. 44–57.

SAT-2010-BubeckB #quantifier

Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN (UB, HKB), pp. 58–70.

SAT-2010-FuhsS #linear #satisfiability #source code #using

Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT (CF, PSK), pp. 71–84.

SAT-2010-GiunchigliaMN #effectiveness #equivalence #named #preprocessor #reasoning

sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning (EG, PM, MN), pp. 85–98.

SAT-2010-BoufkhadH #bound #satisfiability

Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold (YB, TH), pp. 99–112.

SAT-2010-KatebiSM #satisfiability #symmetry

Symmetry and Satisfiability: An Update (HK, KAS, ILM), pp. 113–127.

SAT-2010-KlieberSGC #learning

A Non-prenex, Non-clausal QBF Solver with Game-State Learning (WK, SS, SG, EMC), pp. 128–142.

SAT-2010-Kottler #satisfiability

SAT Solving with Reference Points (SK), pp. 143–157.

SAT-2010-LonsingB #dependence #search-based

Integrating Dependency Schemes in Search-Based QBF Solvers (FL, AB), pp. 158–171.

SAT-2010-MakinoTY #algorithm #problem

An Exact Algorithm for the Boolean Connectivity Problem for k-CNF (KM, ST, MY), pp. 172–180.

SAT-2010-ManquinhoML #algorithm #optimisation #satisfiability

Improving Unsatisfiability-Based Algorithms for Boolean Optimization (VMM, RM, IL), pp. 181–193.

SAT-2010-MillerKLB #bound #design #encoding #model checking

Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs (CM, SK, MDTL, BB), pp. 194–208.

SAT-2010-Nikolic #comparison #satisfiability #statistics

Statistical Methodology for Comparison of SAT Solvers (MN), pp. 209–222.

SAT-2010-PankratovB #on the #problem #satisfiability

On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem (DP, AB), pp. 223–236.

SAT-2010-PeschieraPTBKL #evaluation

The Seventh QBF Solvers Evaluation (QBFEVAL’10) (CP, LP, AT, UB, OK, IL), pp. 237–250.

SAT-2010-PorschenSS #complexity #linear #problem

Complexity Results for Linear XSAT-Problems (SP, TS, ES), pp. 251–263.

SAT-2010-RathiARS #bound #random #satisfiability

Bounds on Threshold of Regular Random k-SAT (VR, EA, LKR, MS), pp. 264–277.

SAT-2010-TompkinsH #satisfiability

Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT (DADT, HHH), pp. 278–292.

SAT-2010-BelovS #satisfiability

Improved Local Search for Circuit Satisfiability (AB, ZS), pp. 293–299.

SAT-2010-BofillSV #constraints #problem #smt

A System for Solving Constraint Satisfaction Problems with SMT (MB, JS, MV), pp. 300–305.

SAT-2010-Cotton #proving

Two Techniques for Minimizing Resolution Proofs (SC), pp. 306–312.

SAT-2010-DantsinW #exponential #on the #satisfiability

On Moderately Exponential Time for SAT (ED, AW), pp. 313–325.

SAT-2010-Ehlers #automaton #satisfiability #using

Minimising Deterministic Büchi Automata Precisely Using SAT Solving (RE), pp. 326–332.

SAT-2010-GoultiaevaB

Exploiting Circuit Representations in QBF Solving (AG, FB), pp. 333–339.

SAT-2010-JarvisaloB

Reconstructing Solutions after Blocked Clause Elimination (MJ, AB), pp. 340–345.

SAT-2010-KrocSS #empirical #runtime

An Empirical Study of Optimal Noise and Runtime Distributions in Local Search (LK, AS, BS), pp. 346–351.

SAT-2010-Kullmann #satisfiability

Green-Tao Numbers and SAT (OK), pp. 352–362.

SAT-2010-LiMQZ #satisfiability

Exact MinSAT Solving (CML, FM, ZQ, ZZ), pp. 363–368.

SAT-2010-MatthewsP #satisfiability

Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable (WM, RP), pp. 369–374.

SAT-2010-NadelR #stack

Assignment Stack Shrinking (AN, VR), pp. 375–381.

SAT-2010-NamasivayamT

Simple but Hard Mixed Horn Formulas (GN, MT), pp. 382–387.

SAT-2010-GelderS #design #satisfiability

Zero-One Designs Produce Small Hard SAT Instances (AVG, IS), pp. 388–397.