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

  • Carsten Sinz
  • Uwe Egly
Conference proceedings SAT 2014

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

Table of contents

  1. Front Matter
    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 MaxSAT and #SAT 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

About these proceedings

Introduction

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.

Keywords

Boolean optimization MaxSAT QBF SAT SAT solvers SMT Theorem proving and SAT solving computational complexity constraint programming logic proof complexity propositional satisfiability problem quantified Boolean formulas satisfiability modulo theories theory of computation

Editors and affiliations

  • Carsten Sinz
    • 1
  • Uwe Egly
    • 2
  1. 1.Karlsruher Institut für Technologie (KIT)KarlsruheGermany
  2. 2.TU WienWienAustria

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-09284-3
  • Copyright Information Springer International Publishing Switzerland 2014
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-09283-6
  • Online ISBN 978-3-319-09284-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site