Abstract is missing.
- CCAnr: A Configuration Checking Based Local Search Solver for Non-random SatisfiabilityShaowei Cai, Chuan Luo, Kaile Su. 1-8 [doi]
- PBLib - A Library for Encoding Pseudo-Boolean Constraints into CNFTobias Philipp, Peter Steinke. 9-16 [doi]
- Speeding up MUS Extraction with Preprocessing and ChunkingValeriy Balabanov, Alexander Ivrii. 17-32 [doi]
- Improved Algorithms for Sparse MAX-SAT and MAX-k-CSPRuiwen Chen, Rahul Santhanam. 33-45 [doi]
- Laissez-Faire Caching for Parallel #SAT SolvingJan Burchard, Tobias Schubert, Bernd Becker. 46-61 [doi]
- SATGraf: Visualizing the Evolution of SAT Formula Structure in SolversZack Newsham, William Lindsay, Vijay Ganesh, Jia Hui Liang, Sebastian Fischmeister, Krzysztof Czarnecki. 62-70 [doi]
- Hints RevealedJonathan Kalechstain, Vadim Ryvchin, Nachum Dershowitz. 71-87 [doi]
- Mining Backbone Literals in Incremental SAT - A New Kind of Incremental DataAlexander Ivrii, Vadim Ryvchin, Ofer Strichman. 88-103 [doi]
- Constructing SAT Filters with a Quantum AnnealerAdam Douglass, Andrew D. King, Jack Raymond. 104-120 [doi]
- #∃SAT: Projected Model CountingRehan Abdul Aziz, Geoffrey Chu, Christian J. Muise, Peter J. Stuckey. 121-137 [doi]
- Computing Maximal Autarkies with Few and Simple Oracle QueriesOliver Kullmann, Joao Marques-Silva. 138-155 [doi]
- HordeSat: A Massively Parallel Portfolio SAT SolverTomas Balyo, Peter Sanders, Carsten Sinz. 156-172 [doi]
- Preprocessing for DQBFRalf Wimmer, Karina Gitina, Jennifer Nist, Christoph Scholl, Bernd Becker. 173-190 [doi]
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver APIFlorian Lonsing, Uwe Egly. 191-198 [doi]
- On Compiling CNFs into Structured Deterministic DNNFsSimone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky. 199-214 [doi]
- SpySMAC: Automated Configuration and Performance Analysis of SAT SolversStefan Falkner, Marius Thomas Lindauer, Frank Hutter. 215-222 [doi]
- Community Structure Inspired Algorithms for SAT and #SATRobert Ganian, Stefan Szeider. 223-237 [doi]
- Using Community Structure to Detect Relevant Learnt ClausesCarlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy, Laurent Simon. 238-254 [doi]
- Recognition of Nested Gates in CNF FormulasMarkus Iser, Norbert Manthey, Carsten Sinz. 255-271 [doi]
- Exploiting Resolution-Based Representations for MaxSAT SolvingMiguel Neves, Ruben Martins, Mikolás Janota, Inês Lynce, Vasco M. Manquinho. 272-286 [doi]
- SAT-Based Formula SimplificationAlexey Ignatiev, Alessandro Previti, Joao Marques-Silva. 287-298 [doi]
- Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT InstancesRavi Mangal, Xin Zhang, Aditya V. Nori, Mayur Naik. 299-306 [doi]
- Between SAT and UNSAT: The Fundamental Difference in CDCL SATChanseok Oh. 307-323 [doi]
- Efficient MUS Enumeration of Horn Formulae with Applications to Axiom PinpointingM. Fareed Arif, Carlos Mencía, Joao Marques-Silva. 324-342 [doi]
- QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT SolvingKuan-Hua Tu, Tzu-Chien Hsu, Jie-Hong R. Jiang. 343-359 [doi]
- SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT SolvingFlorian Corzilius, Gereon Kremer, Sebastian Junges, Stefan Schupp, Erika Ábrahám. 360-368 [doi]
- Search-Space Partitioning for Parallelizing SMT SolversAntti E. J. Hyvärinen, Matteo Marescotti, Natasha Sharygina. 369-386 [doi]
- A New Approach to Partial MUS EnumerationChristian Zielke, Michael Kaufmann 0001. 387-404 [doi]
- Evaluating CDCL Variable Scoring SchemesArmin Biere, Andreas Fröhlich. 405-422 [doi]
- SAT-Based Horn Least Upper BoundsCarlos Mencía, Alessandro Previti, Joao Marques-Silva. 423-433 [doi]