Skip to main content
SpringerLink
Log in

Theory and Applications of Satisfiability Testing - SAT 2014

17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014, Proceedings

  • Conference proceedings
  • © 2014

Overview

Editors:
  1. Carsten Sinz

    1. Karlsruher Institut für Technologie (KIT), Karlsruhe, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Uwe Egly

    1. TU Wien, Wien, Austria

    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 8561)

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

Included in the following conference series:

Conference proceedings info: SAT 2014.

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (33 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talk

    1. A (Biased) Proof Complexity Survey for SAT Practitioners

      • Jakob Nordström
      Pages 1-6

  3. Technical Papers

    1. Maximum Satisfiability

      1. Cores in Core Based MaxSat Algorithms: An Analysis
        • Fahiem Bacchus, Nina Narodytska
        Pages 7-15
      2. Solving <span class="u-small-caps">MaxSAT</span> and <span class="u-small-caps">#SAT</span> on Structured CNF Formulas
        • Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle
        Pages 16-31
      3. Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
        • Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki
        Pages 32-47

    2. Minimal Unsatisfiability

      1. MUS Extraction Using Clausal Proofs
        • Anton Belov, Marijn J. H. Heule, Joao Marques-Silva
        Pages 48-57
      2. On Computing Preferred MUSes and MCSes
        • Joao Marques-Silva, Alessandro Previti
        Pages 58-74

    3. Complexity and Reductions

      1. Conditional Lower Bounds for Failed Literals and Related Techniques
        • Matti Järvisalo, Janne H. Korhonen
        Pages 75-84
      2. Fixed-Parameter Tractable Reductions to SAT
        • Ronald de Haan, Stefan Szeider
        Pages 85-102
      3. On Reducing Maximum Independent Set to Minimum Satisfiability
        • Alexey Ignatiev, Antonio Morgado, Joao Marques-Silva
        Pages 103-120

    4. Proof Complexity

      1. Long Proofs of (Seemingly) Simple Formulas
        • Mladen Mikša, Jakob Nordström
        Pages 121-137
      2. Proof Complexity and the Kneser-Lovász Theorem
        • Gabriel Istrate, Adrian Crãciun
        Pages 138-153
      3. QBF Resolution Systems and Their Proof Complexities
        • Valeriy Balabanov, Magdalena Widl, Jie-Hong R. Jiang
        Pages 154-169
      4. Unified Characterisations of Resolution Hardness Measures
        • Olaf Beyersdorff, Oliver Kullmann
        Pages 170-187

    5. Parallel and Incremental (Q)SAT

      1. Community Branching for Parallel Portfolio SAT Solvers
        • Tomohiro Sonobe, Shuya Kondoh, Mary Inaba
        Pages 188-196
      2. Lazy Clause Exchange Policy for Parallel SAT Solvers
        • Gilles Audemard, Laurent Simon
        Pages 197-205
      3. Ultimately Incremental SAT
        • Alexander Nadel, Vadim Ryvchin, Ofer Strichman
        Pages 206-218

    6. Applications

      1. A SAT Attack on the Erdős Discrepancy Conjecture
        • Boris Konev, Alexei Lisitsa
        Pages 219-226
      2. Dominant Controllability Check Using QBF-Solver and Netlist Optimizer
        • Tamir Heyman, Dan Smith, Yogesh Mahajan, Lance Leong, Husam Abu-Haimed
        Pages 227-242
      3. Fast DQBF Refutation
        • Bernd Finkbeiner, Leander Tentrup
        Pages 243-251
Back to top

Other volumes

  1. Theory and Applications of Satisfiability Testing – SAT 2014

Keywords

About this book

This book constitutes the refereed proceedings of the 17th International Conference on Theory and Applications of Satisfiability Testing, SAT 2014, held as part of the Vienna Summer of Logic, VSL 2014, in Vienna, Austria, in July 2014. The 21 regular papers, 7 short papers and 4 tool papers presented together with 2 invited talks were carefully reviewed and selected from 78 submissions. The papers have been organized in the following topical sections: maximum satisfiability; minimal unsatisfiability; complexity and reductions; proof complexity; parallel and incremental (Q)SAT; applications; structure; simplification and solving; and analysis.

Editors and Affiliations

  • Karlsruher Institut für Technologie (KIT), Karlsruhe, Germany

    Carsten Sinz

  • TU Wien, Wien, Austria

    Uwe Egly

Bibliographic Information

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

  • Book Subtitle: 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014, Proceedings

  • Editors: Carsten Sinz, Uwe Egly

  • Series Title: Lecture Notes in Computer Science

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

  • Publisher: Springer Cham

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

  • Copyright Information: Springer International Publishing Switzerland 2014

  • Softcover ISBN: 978-3-319-09283-6Published: 04 August 2014

  • eBook ISBN: 978-3-319-09284-3Published: 02 July 2014

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XXVI, 448

  • Number of Illustrations: 77 b/w illustrations

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

Publish with us

Policies and ethics

Back to top

Search

Navigation