Proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Marijn Heule, Sean Weaver
Proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing
SAT, 2015.

TEST
DBLP
Scholar
DOI
Full names Links ISxN
@proceedings{SAT-2015,
	address       = "Austin, Texas, USA",
	doi           = "10.1007/978-3-319-24318-4",
	editor        = "Marijn Heule and Sean Weaver",
	isbn          = "978-3-319-24317-7",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing}",
	volume        = 9340,
	year          = 2015,
}

Contents (30 items)

SAT-2015-CaiLS #named #satisfiability
CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability (SC, CL, KS), pp. 1–8.
SAT-2015-PhilippS #constraints #encoding #library #named #pseudo
PBLib — A Library for Encoding Pseudo-Boolean Constraints into CNF (TP, PS), pp. 9–16.
SAT-2015-BalabanovI #preprocessor
Speeding up MUS Extraction with Preprocessing and Chunking (VB, AI), pp. 17–32.
SAT-2015-ChenS #algorithm #satisfiability
Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP (RC, RS), pp. 33–45.
SAT-2015-BurchardSB #parallel #satisfiability
Laissez-Faire Caching for Parallel #SAT Solving (JB, TS, BB), pp. 46–61.
SAT-2015-NewshamLGLFC #evolution #named #satisfiability #visualisation
SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers (ZN, WL, VG, JHL, SF, KC), pp. 62–70.
SAT-2015-KalechstainRD
Hints Revealed (JK, VR, ND), pp. 71–87.
SAT-2015-IvriiRS #incremental #mining #satisfiability
Mining Backbone Literals in Incremental SAT — A New Kind of Incremental Data (AI, VR, OS), pp. 88–103.
SAT-2015-DouglassKR #quantum #satisfiability
Constructing SAT Filters with a Quantum Annealer (AD, ADK, JR), pp. 104–120.
SAT-2015-AzizCMS
#∃SAT: Projected Model Counting (RAA, GC, CJM, PJS), pp. 121–137.
SAT-2015-KullmannM #query
Computing Maximal Autarkies with Few and Simple Oracle Queries (OK, JMS), pp. 138–155.
SAT-2015-BalyoSS #named #parallel #satisfiability
HordeSat: A Massively Parallel Portfolio SAT Solver (TB, PS, CS), pp. 156–172.
SAT-2015-WimmerGNSB #preprocessor
Preprocessing for DQBF (RW, KG, JN, CS, BB), pp. 173–190.
SAT-2015-LonsingE #api #incremental #satisfiability
Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API (FL, UE), pp. 191–198.
SAT-2015-BovaCMS #compilation #on the
On Compiling CNFs into Structured Deterministic DNNFs (SB, FC, SM, FS), pp. 199–214.
SAT-2015-FalknerLH #analysis #automation #named #performance #satisfiability
SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers (SF, MTL, FH), pp. 215–222.
SAT-2015-GanianS #algorithm #community #satisfiability
Community Structure Inspired Algorithms for SAT and #SAT (RG, SS), pp. 223–237.
SAT-2015-AnsoteguiGLS #community #detection #using
Using Community Structure to Detect Relevant Learnt Clauses (CA, JGC, JL, LS), pp. 238–254.
SAT-2015-IserMS #recognition
Recognition of Nested Gates in CNF Formulas (MI, NM, CS), pp. 255–271.
SAT-2015-NevesMJLM #satisfiability
Exploiting Resolution-Based Representations for MaxSAT Solving (MN, RM, MJ, IL, VMM), pp. 272–286.
SAT-2015-IgnatievPM #satisfiability
SAT-Based Formula Simplification (AI, AP, JMS), pp. 287–298.
SAT-2015-MangalZNN #framework #lazy evaluation #named #satisfiability #scalability
Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances (RM, XZ, AVN, MN), pp. 299–306.
SAT-2015-Oh #difference #satisfiability
Between SAT and UNSAT: The Fundamental Difference in CDCL SAT (CO), pp. 307–323.
SAT-2015-ArifMM #axiom #performance
Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing (MFA, CM, JMS), pp. 324–342.
SAT-2015-TuHJ #learning #named #reasoning #satisfiability
QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving (KHT, TCH, JHRJ), pp. 343–359.
SAT-2015-CorziliusKJSA #c++ #named #open source #parallel #smt
SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving (FC, GK, SJ, SS, ), pp. 360–368.
SAT-2015-HyvarinenMS #clustering #smt
Search-Space Partitioning for Parallelizing SMT Solvers (AEJH, MM, NS), pp. 369–386.
SAT-2015-Zielke0 #approach
A New Approach to Partial MUS Enumeration (CZ, MK), pp. 387–404.
SAT-2015-BiereF
Evaluating CDCL Variable Scoring Schemes (AB, AF), pp. 405–422.
SAT-2015-MenciaPM #bound #satisfiability
SAT-Based Horn Least Upper Bounds (CM, AP, JMS), pp. 423–433.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.