Matti Järvisalo, Allen Van Gelder
Proceedings of the 16th International Conference on Theory and Applications of Satisfiability Testing
SAT, 2013.

@proceedings{SAT-2013,
	address       = "Helsinki, Finland",
	doi           = "10.1007/978-3-642-39071-5",
	editor        = "Matti Järvisalo and Allen Van Gelder",
	isbn          = "978-3-642-39070-8",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 16th International Conference on Theory and Applications of Satisfiability Testing}",
	volume        = 7962,
	year          = 2013,
}

Contents (34 items)

13 ×#satisfiability
5 ×#named
4 ×#approach
4 ×#constraints
4 ×#proving
3 ×#bound
3 ×#on the
3 ×#quantifier
2 ×#clique
2 ×#complexity

SAT-2013-Atserias #algebra #bound #problem #proving

The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs (AA), pp. 1–17.

SAT-2013-Clarke #why

Turing’s Computable Real Numbers and Why They Are Still Important Today (EMC), p. 18.

SAT-2013-Stuckey #problem

There Are No CNF Problems (PJS), pp. 19–21.

SAT-2013-MantheyPW #satisfiability

Soundness of Inprocessing in Clause Sharing SAT Solvers (NM, TP, CW), pp. 22–39.

SAT-2013-Johannsen #exponential #learning #proving

Exponential Separations in a Hierarchy of Clause Learning Proof Systems (JJ), pp. 40–51.

SAT-2013-Toran #complexity #graph #morphism #on the

On the Resolution Complexity of Graph Non-isomorphism (JT), pp. 52–66.

SAT-2013-JanotaM #on the

On Propositional QBF Expansions and Q-Resolution (MJ, JMS), pp. 67–82.

SAT-2013-GoultiaevaB

Recovering and Utilizing Partial Duality in QBF (AG, FB), pp. 83–99.

SAT-2013-LonsingEG #learning #performance #pseudo #quantifier

Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation (FL, UE, AVG), pp. 100–115.

SAT-2013-WieringaH #concurrent

Concurrent Clause Strengthening (SW, KH), pp. 116–132.

SAT-2013-BelovMM #parallel

Parallel MUS Extraction (AB, NM, JMS), pp. 133–149.

SAT-2013-CimattiGSS #approach #composition #modulo theories #satisfiability

A Modular Approach to MaxSAT Modulo Theories (AC, AG, BJS, RS), pp. 150–165.

SAT-2013-DaviesB #power of #satisfiability

Exploiting the Power of mip Solvers in maxsat (JD, FB), pp. 166–181.

SAT-2013-MartinsML #clustering #satisfiability

Community-Based Partitioning for MaxSAT Solving (RM, VMM, IL), pp. 182–191.

SAT-2013-JordanK #reduction

Experiments with Reduction Finding (CJ, LK), pp. 192–207.

SAT-2013-MihalT #approach #constraints #logic #programmable

A Constraint Satisfaction Approach for Programmable Logic Detailed Placement (AM, ST), pp. 208–223.

SAT-2013-IserST #modelling #satisfiability

Minimizing Models for Tseitin-Encoded SAT Instances (MI, CS, MT), pp. 224–232.

SAT-2013-FingerLGS #constraints #probability #satisfiability #using

Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability (MF, RL, CPG, BS), pp. 233–249.

SAT-2013-IgnatievJM #approach #quantifier #satisfiability

Quantified Maximum Satisfiability: — A Core-Guided Approach (AI, MJ, JMS), pp. 250–266.

SAT-2013-BubeckB #modelling #quantifier

Nested Boolean Functions as Models for Quantified Boolean Formulas (UB, HKB), pp. 267–275.

SAT-2013-LagniezB

Factoring Out Assumptions to Speed Up MUS Extraction (JML, AB), pp. 276–292.

SAT-2013-Gableske #heuristic #message passing #on the #satisfiability

On the Interpolation between Product-Based Message Passing Heuristics for SAT (OG), pp. 293–308.

SAT-2013-AudemardLS #incremental #satisfiability

Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction (GA, JML, LS), pp. 309–317.

SAT-2013-HeuleS #approach #clique #satisfiability

A SAT Approach to Clique-Width (MH, SS), pp. 318–334.

SAT-2013-RazgonP #clique #compilation

Cliquewidth and Knowledge Compilation (IR, JP), pp. 335–350.

SAT-2013-Lauria #bound #proving #rank #theorem

A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem (ML), pp. 351–364.

SAT-2013-Beyersdorff #complexity #logic #proving #theorem proving

The Complexity of Theorem Proving in Autoepistemic Logic (OB), pp. 365–376.

SAT-2013-HaanKS

Local Backbones (RdH, IAK, SS), pp. 377–393.

SAT-2013-MisraORS #bound #detection #set

Upper and Lower Bounds for Weak Backdoor Set Detection (NM, SO, VR, SS), pp. 394–402.

SAT-2013-Ben-Ari #education #named #satisfiability

LearnSAT: A SAT Solver for Education (MBA), pp. 403–407.

SAT-2013-DellertZK #interactive #named

MUStICCa: MUS Extraction with Interactive Choice of Candidates (JD, CZ, MK), pp. 408–414.

SAT-2013-FujitaKH #constraints #named #satisfiability

SCSat: A Soft Constraint Guided SAT Solver (HF, MK, RH), pp. 415–421.

SAT-2013-SamulowitzRSS #algorithm #named

Snappy: A Simple Algorithm Portfolio (HS, CR, AS, MS), pp. 422–428.

SAT-2013-SohTB #agile #constraints #named #programming #prototype #satisfiability

Scarab: A Rapid Prototyping Tool for SAT-Based Constraint Programming Systems (TS, NT, MB), pp. 429–436.