Advertisement

Theory and Applications of Satisfiability Testing – SAT 2016

19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings

  • Nadia Creignou
  • Daniel Le Berre

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

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9710)

Table of contents

  1. Front Matter
    Pages I-XXIV
  2. Complexity

    1. Front Matter
      Pages 1-1
    2. Mateus de Oliveira Oliveira
      Pages 13-28
    3. Patrick Scharpfenecker, Jacobo Torán
      Pages 29-44
    4. Johannes K. Fichte, Arne Meier, Irina Schindler
      Pages 45-59
  3. Satisfiability Solving

    1. Front Matter
      Pages 85-85
    2. Gilles Audemard, Laurent Simon
      Pages 87-103
    3. Jo Devriendt, Bart Bogaerts, Maurice Bruynooghe, Marc Denecker
      Pages 104-122
    4. Jia Hui Liang, Vijay Ganesh, Pascal Poupart, Krzysztof Czarnecki
      Pages 123-140
    5. Nathan Mull, Daniel J. Fremont, Sanjit A. Seshia
      Pages 141-159
    6. Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals
      Pages 160-176
  4. Satisfiability Applications

    1. Front Matter
      Pages 177-177
    2. Neha Lodha, Sebastian Ordyniak, Stefan Szeider
      Pages 179-195
    3. C. K. Cuong, M. J. H. Heule
      Pages 196-211
    4. Mathias Soeken, Alan Mishchenko, Ana Petkovska, Baruch Sterin, Paolo Ienne, Robert K. Brayton et al.
      Pages 212-227
    5. Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek
      Pages 228-245
  5. Satisfiability Modulo Theory

    1. Front Matter
      Pages 247-247
    2. Aleksandar Zeljić, Christoph M. Wintersteiger, Philipp Rümmer
      Pages 249-266
    3. Martin Jonáš, Jan Strejček
      Pages 267-283
    4. Lorenzo Candeago, Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio
      Pages 284-301
    5. Jeevana Priya Inala, Rohit Singh, Armando Solar-Lezama
      Pages 302-320
  6. Beyond SAT

    1. Front Matter
      Pages 321-321
    2. Giles Reger, Martin Suda, Andrei Voronkov
      Pages 323-341
    3. Carlos Mencía, Alexey Ignatiev, Alessandro Previti, Joao Marques-Silva
      Pages 342-360
    4. Zurab Khasidashvili, Konstantin Korovin
      Pages 361-372
  7. Quantified Boolean Formula

    1. Front Matter
      Pages 373-373
    2. Markus N. Rabe, Sanjit A. Seshia
      Pages 375-392
    3. Leander Tentrup
      Pages 393-401
    4. Mikoláš Janota
      Pages 402-418
    5. Uwe Egly
      Pages 419-434
    6. Florian Lonsing, Uwe Egly, Martina Seidl
      Pages 435-452
    7. Valeriy Balabanov, Jie-Hong Roland Jiang, Christoph Scholl, Alan Mishchenko, Robert K. Brayton
      Pages 453-469
  8. Dependency QBF

    1. Front Matter
      Pages 471-471
    2. Ralf Wimmer, Christoph Scholl, Karina Wimmer, Bernd Becker
      Pages 473-489
    3. Olaf Beyersdorff, Leroy Chew, Renate A. Schmidt, Martin Suda
      Pages 490-499
    4. Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
      Pages 500-518
  9. Tools

    1. Front Matter
      Pages 519-519
    2. M. Fareed Arif, Carlos Mencía, Alexey Ignatiev, Norbert Manthey, Rafael Peñaloza, Joao Marques-Silva
      Pages 521-530
    3. Tomáš Balyo, Florian Lonsing
      Pages 531-538
    4. Paul Saikko, Jeremias Berg, Matti Järvisalo
      Pages 539-546
    5. Antti E. J. Hyvärinen, Matteo Marescotti, Leonardo Alt, Natasha Sharygina
      Pages 547-553
    6. Norbert Manthey, Marius Lindauer
      Pages 554-561
  10. Back Matter
    Pages 563-564

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 19th International Conference on Theory and Applications of Satisfiability Testing, SAT 2016, held in Bordeaux, France, in July 2016.

The 31 regular papers, 5 tool papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions. The papers address different aspects of SAT, including complexity, satisfiability solving, satisfiability applications, satisfiability modulop theory, beyond SAT, quantified Boolean formula, and dependency QBF.

 

Keywords

analysis of algorithms combinatorial optimization constraint programming formal methods SAT solvers combinatorics computational complexity database dependencies graph theory inconsistent databases integer programming local search logic and verification maximum satisfiability MaxSAT proof complexity satisfiability solving search algorithms smooth pictures

Editors and affiliations

  • Nadia Creignou
    • 1
  • Daniel Le Berre
    • 2
  1. 1.Aix-Marseille UniversitéMarseilleFrance
  2. 2.Université d'ArtoisLensFrance

Bibliographic information

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