Skip to main content
SpringerLink
Log in
Book cover

Theory and Applications of Satisfiability Testing - SAT 2013

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

  • Conference proceedings
  • © 2013

Overview

Editors:
  1. Matti Järvisalo

    1. HIIT and Department of Computer Science, University of Helsinki, Helsinki, Finland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Allen Van Gelder

    1. Computer Science Department, University of California at Santa Cruz, Santa Cruz, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Fast-track conference proceeding of SAT 2013

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

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

Included in the following conference series:

Conference proceedings info: SAT 2013.

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 (34 papers)

  1. Front Matter

    Download chapter PDF

  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

      1. Exponential Separations in a Hierarchy of Clause Learning Proof Systems
        • Jan Johannsen
        Pages 40-51
      2. On the Resolution Complexity of Graph Non-isomorphism
        • Jacobo Torán
        Pages 52-66

    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 <span class="u-small-caps">mip</span> Solvers in <span class="u-small-caps">maxsat</span>
        • 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. A Constraint Satisfaction Approach for Programmable Logic Detailed Placement
        • Andrew Mihal, Steve Teig
        Pages 208-223
      3. 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
Back to top

Other volumes

  1. Theory and Applications of Satisfiability Testing – SAT 2013

Keywords

About this book

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 (850 regular, 15 short and 16 tool papers). The focus of the papers in on following topics: maximum satisfiability, encodings and applications, solver techniques and algorithms, clique-width and SAT, propositional proof complexity, parameterized complexity.

Editors and Affiliations

  • HIIT and Department of Computer Science, University of Helsinki, Helsinki, Finland

    Matti Järvisalo

  • Computer Science Department, University of California at Santa Cruz, Santa Cruz, USA

    Allen Van Gelder

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation