Alessandro Cimatti, Roberto Sebastiani
Proceedings of the 15th International Conference on Theory and Applications of Satisfiability Testing
SAT, 2012.

@proceedings{SAT-2012,
	address       = "Trento, Italy",
	doi           = "10.1007/978-3-642-31612-8",
	editor        = "Alessandro Cimatti and Roberto Sebastiani",
	isbn          = "978-3-642-31611-1",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 15th International Conference on Theory and Applications of Satisfiability Testing}",
	volume        = 7317,
	year          = 2012,
}

Contents (38 items)

24 ×#satisfiability
6 ×#named
5 ×#algorithm
5 ×#learning
4 ×#parallel
4 ×#performance
3 ×#constraints
3 ×#on the
3 ×#preprocessor
3 ×#problem

SAT-2012-Bradley #comprehension

Understanding IC3 (ARB), pp. 1–14.

SAT-2012-Knuth #programming #satisfiability

Satisfiability and The Art of Computer Programming (DEK), p. 15.

SAT-2012-BalintS #probability

Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break (AB, US), pp. 16–29.

SAT-2012-GoultiaevaB #algorithm

Off the Trail: Re-examining the CDCL Algorithm (AG, FB), pp. 30–43.

SAT-2012-BonetB #learning

An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning (MLB, SRB), pp. 44–57.

SAT-2012-SlivovskyS #dependence #linear

Computing Resolution-Path Dependencies in Linear Time , (FS, SS), pp. 58–71.

SAT-2012-GaspersS #satisfiability

Strong Backdoors to Nested Satisfiability (SG, SS), pp. 72–85.

SAT-2012-GelderWL #preprocessor #quantifier

Extended Failed-Literal Preprocessing for Quantified Boolean Formulas (AVG, SBW, FL), pp. 86–99.

SAT-2012-Egly #on the

On Sequent Systems and Resolution for QBFs (UE), pp. 100–113.

SAT-2012-JanotaKMC #refinement

Solving QBF with Counterexample Guided Refinement (MJ, WK, JMS, EMC), pp. 114–128.

SAT-2012-BalabanovCJ #quantifier

Henkin Quantifiers and Boolean Formulae (VB, HJKC, JHRJ), pp. 129–142.

SAT-2012-GaneshOSDRS #named #problem #satisfiability

Lynx: A Programmatic SAT Solver for the RNA-Folding Problem (VG, CWO, MS, SD, MCR, ASL), pp. 143–156.

SAT-2012-HoderB #reachability

Generalized Property Directed Reachability (KH, NB), pp. 157–171.

SAT-2012-ErmonLGSD #combinator

SMT-Aided Combinatorial Materials Discovery (SE, RL, CPG, BS, RBvD), pp. 172–185.

SAT-2012-ZhangMZ #constraints #identification #interactive #optimisation #theorem proving

Faulty Interaction Identification via Constraint Solving and Optimization (JZ, FM, ZZ), pp. 186–199.

SAT-2012-AudemardHJLP #parallel #satisfiability

Revisiting Clause Exchange in Parallel SAT Solving (GA, BH, SJ, JML, CP), pp. 200–213.

SAT-2012-HyvarinenM #design #parallel #satisfiability #scalability

Designing Scalable Parallel SAT Solvers (AEJH, NM), pp. 214–227.

SAT-2012-XuHHL #algorithm #component

Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors (LX, FH, HH, KLB), pp. 228–241.

SAT-2012-NadelR #performance #satisfiability

Efficient SAT Solving under Assumptions (AN, VR), pp. 242–255.

SAT-2012-NadelRS #incremental #preprocessor #satisfiability

Preprocessing in Incremental SAT (AN, VR, OS), pp. 256–269.

SAT-2012-KullmannZ #on the #reduction #satisfiability

On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets (OK, XZ), pp. 270–283.

SAT-2012-MorgadoHM #satisfiability

Improvements to Core-Guided Binary Search for MaxSAT (AM, FH, JMS), pp. 284–297.

SAT-2012-BelovIMM #on the #performance

On Efficient Computation of Variable MUSes (AB, AI, AM, JMS), pp. 298–311.

SAT-2012-Weissenbacher #revisited

Interpolant Strength Revisited (GW), pp. 312–326.

SAT-2012-AchlioptasM #algorithm #bound #exponential #random #satisfiability

Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas (DA, RMM), pp. 327–340.

SAT-2012-CreignouV #complexity #problem #satisfiability

Parameterized Complexity of Weighted Satisfiability Problems (NC, HV), pp. 341–354.

SAT-2012-CrowstonGJRSY #parametricity

Fixed-Parameter Tractability of Satisfying beyond the Number of Variables (RC, GG, MJ, VR, SS, AY), pp. 355–368.

SAT-2012-JarvisaloKKK #performance

Finding Efficient Circuits for Ensemble Computation (MJ, PK, MK, JHK), pp. 369–382.

SAT-2012-LaitinenJN #learning

Conflict-Driven XOR-Clause Learning (TL, TAJ, IN), pp. 383–396.

SAT-2012-Ben-HaimIMM #constraints #encoding

Perfect Hashing and CNF Encodings of Cardinality Constraints (YBH, AI, OM, AM), pp. 397–409.

SAT-2012-AnsoteguiGL #community #satisfiability

The Community Structure of SAT Formulas (CA, JGC, JL), pp. 410–423.

SAT-2012-Hugel #named #random #satisfiability

SATLab: X-Raying Random k-SAT — (TH), pp. 424–429.

SAT-2012-NiemetzPLSB

Resolution-Based Certificate Extraction for QBF — (AN, MP, FL, MS, AB), pp. 430–435.

SAT-2012-Manthey #flexibility

Coprocessor 2.0 — A Flexible CNF Simplifier — (NM), pp. 436–441.

SAT-2012-CorziliusLJA #named

SMT-RAT: An SMT-Compliant Nonlinear Real Arithmetic Toolbox — (FC, UL, SJ, EÁ), pp. 442–448.

SAT-2012-KottlerZSK #analysis #named #satisfiability

CoPAn: Exploring Recurring Patterns in Conflict Analysis of CDCL SAT Solvers — (SK, CZ, PS, MK), pp. 449–455.

SAT-2012-TanjoTB #csp #encoding #named #order #satisfiability #using

Azucar: A SAT-Based CSP Solver Using Compact Order Encoding — (TT, NT, MB), pp. 456–462.

SAT-2012-BloomGHSSS #framework #game studies #named #parallel #satisfiability #scalability

SatX10: A Scalable Plug&Play Parallel SAT Framework — (BB, DG, BH, AS, HS, VAS), pp. 463–468.