Oliver Kullmann
Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
SAT, 2009.

@proceedings{SAT-2009,
	address       = "Swansea, United Kingdom",
	doi           = "10.1007/978-3-642-02777-2",
	editor        = "Oliver Kullmann",
	isbn          = "978-3-642-02776-5",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing}",
	volume        = 5584,
	year          = 2009,
}

Contents (47 items)

19 ×#satisfiability
4 ×#bound
3 ×#algorithm
3 ×#encoding
3 ×#named
3 ×#optimisation
3 ×#problem
3 ×#using
2 ×#complexity
2 ×#learning

SAT-2009-Nieuwenhuis #algorithm #modulo theories #satisfiability

SAT Modulo Theories: Enhancing SAT with Special-Purpose Algorithms (RN), p. 1.

SAT-2009-Vardi #satisfiability

Symbolic Techniques in Propositional Satisfiability Solving (MYV), pp. 2–3.

SAT-2009-BonetJ #metric #satisfiability #using

Efficiently Calculating Evolutionary Tree Measures Using SAT (MLB, KSJ), pp. 4–17.

SAT-2009-ChebiryakWKH #agile

Finding Lean Induced Cycles in Binary Hypercubes (YC, TW, DK, LH), pp. 18–31.

SAT-2009-KojevnikovKY #performance #using

Finding Efficient Circuits Using SAT-Solvers (AK, ASK, GY), pp. 32–44.

SAT-2009-SamerV #encoding #satisfiability

Encoding Treewidth into SAT (MS, HV), pp. 45–50.

SAT-2009-BeyersdorffMTV #complexity #logic #reasoning

The Complexity of Reasoning for Fragments of Default Logic (OB, AM, MT, HV), pp. 51–64.

SAT-2009-BeyersdorffM #question

Does Advice Help to Prove Propositional Tautologies? (OB, SM), pp. 65–72.

SAT-2009-DilkinaGS #learning

Backdoors in the Context of Learning (BND, CPG, AS), pp. 73–79.

SAT-2009-JohannsenRW #satisfiability #strict

Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences (DJ, IR, MW), pp. 80–85.

SAT-2009-PorschenSS #aspect-oriented #on the

On Some Aspects of Mixed Horn Formulas (SP, TS, ES), pp. 86–100.

SAT-2009-Traxler #normalisation

Variable Influences in Conjunctive Normal Forms (PT), pp. 101–113.

SAT-2009-AtseriasFT #algorithm #bound

Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (AA, JKF, MT), pp. 114–127.

SAT-2009-Johannsen #bound #exponential #learning #strict

An Exponential Lower Bound for Width-Restricted Clause Learning (JJ), pp. 128–140.

SAT-2009-Gelder #proving

Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces (AVG), pp. 141–146.

SAT-2009-Goldberg #bound

Boundary Points and Resolution (EG), pp. 147–160.

SAT-2009-ArgelichCLM #encoding #satisfiability

Sequential Encodings from Max-CSP into Partial Max-SAT (JA, AC, IL, FM), pp. 161–166.

SAT-2009-AsinNOR #network

Cardinality Networks and Their Applications (RA, RN, AO, ERC), pp. 167–180.

SAT-2009-BailleuxBR #constraints #encoding #pseudo

New Encodings of Pseudo-Boolean Constraints into CNF (OB, YB, OR), pp. 181–194.

SAT-2009-KimSJ #modulo theories #performance #satisfiability

Efficient Term-ITE Conversion for Satisfiability Modulo Theories (HK, FS, HJ), pp. 195–208.

SAT-2009-HanS #on the fly

On-the-Fly Clause Improvement (HH, FS), pp. 209–222.

SAT-2009-SchaafsmaHM #simulation #symmetry

Dynamic Symmetry Breaking by Simulating Zykov Contraction (BS, MH, HvM), pp. 223–236.

SAT-2009-SorenssonB

Minimizing Learned Clauses (NS, AB), pp. 237–243.

SAT-2009-SoosNC #encryption #problem #satisfiability

Extending SAT Solvers to Cryptographic Problems (MS, KN, CC), pp. 244–257.

SAT-2009-BelovS #probability #process #satisfiability

Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability (AB, ZS), pp. 258–264.

SAT-2009-Skvortsov #analysis

A Theoretical Analysis of Search in GSAT (ESS), pp. 265–275.

SAT-2009-Szeider #complexity #satisfiability

The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (SS), pp. 276–283.

SAT-2009-BalintHG #approach #novel #problem #satisfiability

A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem (AB, MH, OG), pp. 284–297.

SAT-2009-Chen #hybrid #reasoning #satisfiability

Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques (JC), pp. 298–311.

SAT-2009-HaimW #machine learning #using

Restart Strategy Selection Using Machine Learning Techniques (SH, TW), pp. 312–325.

SAT-2009-NikolicMJ #policy #satisfiability

Instance-Based Selection of Policies for SAT Solvers (MN, FM, PJ), pp. 326–340.

SAT-2009-PipatsrisawatD #policy #satisfiability

Width-Based Restart Policies for Clause-Learning Satisfiability Solvers (KP, AD), pp. 341–355.

SAT-2009-SinzI #heuristic #problem

Problem-Sensitive Restart Heuristics for the DPLL Procedure (CS, MI), pp. 356–362.

SAT-2009-CreignouDER #comprehension

(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms (NC, HD, UE, RR), pp. 363–376.

SAT-2009-HsuM #named #novel #probability

VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search (EIH, SAM), pp. 377–390.

SAT-2009-BuningZB #quantifier #subclass

Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits (HKB, XZ, UB), pp. 391–397.

SAT-2009-LonsingB #dependence #representation

A Compact Representation for Syntactic Dependencies in QBFs (FL, AB), pp. 398–411.

SAT-2009-GoultiaevaIB

Beyond CNF: A Circuit-Based QBF Solver (AG, VI, FB), pp. 412–426.

SAT-2009-AnsoteguiBL #satisfiability #testing

Solving (Weighted) Partial MaxSAT through Satisfiability Testing (CA, MLB, JL), pp. 427–440.

SAT-2009-BertholdHP #optimisation #pseudo #question

Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation? (TB, SH, MEP), pp. 441–446.

SAT-2009-KrocSS #satisfiability

Relaxed DPLL Search for MaxSAT (LK, AS, BS), pp. 447–452.

SAT-2009-LarrosaNOR #bound #branch #generative #optimisation

Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates (JL, RN, AO, ERC), pp. 453–466.

SAT-2009-LiMMP #satisfiability

Exploiting Cycle Structures in Max-SAT (CML, FM, NOM, JP), pp. 467–480.

SAT-2009-LiffitonS #satisfiability

Generalizing Core-Guided Max-SAT (MHL, KAS), pp. 481–494.

SAT-2009-ManquinhoSP #algorithm #optimisation

Algorithms for Weighted Boolean Optimization (VMM, JPMS, JP), pp. 495–508.

SAT-2009-LewisMSNBG #distributed #named

PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing (MDTL, PM, TS, MN, BB, EG), pp. 509–523.

SAT-2009-OhmuraU #clustering #named #parallel #satisfiability

c-sat: A Parallel SAT Solver for Clusters (KO, KU), pp. 524–537.