Theory and Applications of Satisfiability Testing -- SAT 2015

1. Front Matter

   Pages I-XIX

   PDF

2. CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability

   • Shaowei Cai, Chuan Luo, Kaile Su

   Pages 1-8

3. PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF

   • Tobias Philipp, Peter Steinke

   Pages 9-16

4. Speeding up MUS Extraction with Preprocessing and Chunking

   • Valeriy Balabanov, Alexander Ivrii

   Pages 17-32

5. Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP

   • Ruiwen Chen, Rahul Santhanam

   Pages 33-45

6. Laissez-Faire Caching for Parallel #SAT Solving

   • Jan Burchard, Tobias Schubert, Bernd Becker

   Pages 46-61

7. SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers

   • Zack Newsham, William Lindsay, Vijay Ganesh, Jia Hui Liang, Sebastian Fischmeister, Krzysztof Czarnecki

   Pages 62-70

8. Hints Revealed

   • Jonathan Kalechstain, Vadim Ryvchin, Nachum Dershowitz

   Pages 71-87

9. Mining Backbone Literals in Incremental SAT

   • Alexander Ivrii, Vadim Ryvchin, Ofer Strichman

   Pages 88-103

10. Constructing SAT Filters with a Quantum Annealer

    • Adam Douglass, Andrew D. King, Jack Raymond

    Pages 104-120Open Access

11. \(\#\exists \)SAT: Projected Model Counting

    • Rehan Abdul Aziz, Geoffrey Chu, Christian Muise, Peter Stuckey

    Pages 121-137

12. Computing Maximal Autarkies with Few and Simple Oracle Queries

    • Oliver Kullmann, João Marques-Silva

    Pages 138-155

13. HordeSat: A Massively Parallel Portfolio SAT Solver

    • Tomáš Balyo, Peter Sanders, Carsten Sinz

    Pages 156-172

14. Preprocessing for DQBF

    • Ralf Wimmer, Karina Gitina, Jennifer Nist, Christoph Scholl, Bernd Becker

    Pages 173-190

15. Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API

    • Florian Lonsing, Uwe Egly

    Pages 191-198

16. On Compiling CNFs into Structured Deterministic DNNFs

    • Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky

    Pages 199-214

17. SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers

    • Stefan Falkner, Marius Lindauer, Frank Hutter

    Pages 215-222

18. Community Structure Inspired Algorithms for SAT and #SAT

    • Robert Ganian, Stefan Szeider

    Pages 223-237

19. Using Community Structure to Detect Relevant Learnt Clauses

    • Carlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy, Laurent Simon

    Pages 238-254

20. Recognition of Nested Gates in CNF Formulas

    • Markus Iser, Norbert Manthey, Carsten Sinz

    Pages 255-271

This book constitutes the refereed proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing, SAT 2015, held in Austin, TX, USA, in September 2015. The 21 regular papers, 2 short papers and 7 tool papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions. The papers address different aspects of SAT, including theoretical advances (exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, and applications, as well as case studies and reports on insightful findings based on rigorous experimentation.The paper 'Constructing SAT Filters with a Quantum Annealer' is published open access under a CC BY-NC 2.5 license at link.springer.com.

• Analysis of algorithms
• Boolean optimization
• Combinatorial theory of satisfiability
• Computational complexity
• Constraint programming
• Exact and parameterized algorithms
• Formal methods
• Logic
• MaxSAT
• Proof complexity
• Proof systems
• Propositional satisfiability problem
• Quantified boolean formulas
• QBF
• Random instances
• SAT
• SAT solvers
• Satisfiability modulo theories
• Search algorithms and heuristics
• SMT

• Algorithms, University of Texas, Austin, USA

  Marijn Heule

• Trusted Systems Research Group, Fort Meade, USA

  Sean Weaver

Policies and ethics