Theory and Applications of Satisfiability Testing – SAT 2013

16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings

  • Matti Järvisalo
  • Allen Van Gelder
Conference proceedings SAT 2013

DOI: 10.1007/978-3-642-39071-5

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

Table of contents (34 papers)

  1. Front Matter
  2. Invited Talks

  3. Best Paper

    1. Soundness of Inprocessing in Clause Sharing SAT Solvers
      Norbert Manthey, Tobias Philipp, Christoph Wernhard
      Pages 22-39
  4. Technical Papers

    1. Propositional Proof Complexity I

    2. Quantified Boolean Formulas

      1. On Propositional QBF Expansions and Q-Resolution
        Mikoláš Janota, Joao Marques-Silva
        Pages 67-82
      2. Recovering and Utilizing Partial Duality in QBF
        Alexandra Goultiaeva, Fahiem Bacchus
        Pages 83-99
      3. Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation
        Florian Lonsing, Uwe Egly, Allen Van Gelder
        Pages 100-115
    3. Parallel Solving

      1. Concurrent Clause Strengthening
        Siert Wieringa, Keijo Heljanko
        Pages 116-132
      2. Parallel MUS Extraction
        Anton Belov, Norbert Manthey, Joao Marques-Silva
        Pages 133-149
    4. Maximum Satisfiability

      1. A Modular Approach to MaxSAT Modulo Theories
        Alessandro Cimatti, Alberto Griggio, Bastiaan Joost Schaafsma, Roberto Sebastiani
        Pages 150-165
      2. Exploiting the Power of mip Solvers in maxsat
        Jessica Davies, Fahiem Bacchus
        Pages 166-181
      3. Community-Based Partitioning for MaxSAT Solving
        Ruben Martins, Vasco Manquinho, Inês Lynce
        Pages 182-191
    5. Encodings and Applications

      1. Experiments with Reduction Finding
        Charles Jordan, Łukasz Kaiser
        Pages 192-207
      2. Minimizing Models for Tseitin-Encoded SAT Instances
        Markus Iser, Carsten Sinz, Mana Taghdiri
        Pages 224-232
    6. Beyond SAT

      1. Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability
        Marcelo Finger, Ronan Le Bras, Carla P. Gomes, Bart Selman
        Pages 233-249
      2. Quantified Maximum Satisfiability:
        Alexey Ignatiev, Mikoláš Janota, Joao Marques-Silva
        Pages 250-266

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 16th International Conference on Theory and Applications of Satisfiability Testing, SAT 2013, held in Helsinki, Finland in July 2013.
The 21 regular papers, 5 short papers, and 5 tool papers presented together with 3 invited talks were carefully reviewed and selected from 71 submissions ( 50 regular, 15 short  and 6 tool papers).
The focus of the papers in on following topics: maximum satifiability, encodings and applications, solver techniques and algorithms, clique-width and SAT, propositional proof complexity, parameterized complexity.

Keywords

SAT solvers constraint optimization experimental finite model theory proof complexity soft constraint

Editors and affiliations

  • Matti Järvisalo
    • 1
  • Allen Van Gelder
    • 2
  1. 1.HIIT and Department of Computer ScienceUniversity of HelsinkiHelsinkiFinland
  2. 2.Computer Science DepartmentUniversity of California at Santa CruzSanta CruzUSA

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2013
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-39070-8
  • Online ISBN 978-3-642-39071-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349