Skip to main content
Springer Nature Link
Log in

Theory and Applications of Satisfiability Testing -- SAT 2015

18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings

  • Conference proceedings
  • © 2015

Overview

Editors:
  1. Marijn Heule

    1. Algorithms, University of Texas, Austin, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Sean Weaver

    1. Trusted Systems Research Group, Fort Meade, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9340)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: SAT 2015.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.



Similar content being viewed by others

Keywords

Table of contents (30 papers)

  1. Front Matter

    Pages I-XIX
    Download chapter 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
Back to top

Other volumes

  1. Theory and Applications of Satisfiability Testing -- SAT 2015

Editors and Affiliations

  • Algorithms, University of Texas, Austin, USA

    Marijn Heule

  • Trusted Systems Research Group, Fort Meade, USA

    Sean Weaver

Bibliographic Information

  • Book Title: Theory and Applications of Satisfiability Testing -- SAT 2015

  • Book Subtitle: 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings

  • Editors: Marijn Heule, Sean Weaver

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/978-3-319-24318-4

  • Publisher: Springer Cham

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer International Publishing Switzerland 2015

  • Softcover ISBN: 978-3-319-24317-7Published: 04 November 2015

  • eBook ISBN: 978-3-319-24318-4Published: 17 September 2015

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XIX, 436

  • Number of Illustrations: 94 illustrations in colour

  • Topics: Theory of Computation, Artificial Intelligence, Mathematics of Computing

Publish with us

Policies and ethics

Back to top