Skip to main content
SpringerLink
Log in

Theory and Applications of Satisfiability Testing – SAT 2016

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

  • Conference proceedings
  • © 2016

Overview

Editors:
  1. Nadia Creignou

    1. Aix-Marseille Université, Marseille, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Daniel Le Berre

    1. Université d'Artois, Lens, France

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

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

Included in the following conference series:

Conference proceedings info: SAT 2016.

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 EPUB and 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 (36 papers)

  1. Front Matter

    Pages I-XXIV
    Download chapter PDF

  2. Complexity

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Parameterized Compilation Lower Bounds for Restricted CNF-Formulas

      • Stefan Mengel
      Pages 3-12

    3. Satisfiability via Smooth Pictures

      • Mateus de Oliveira Oliveira
      Pages 13-28

    4. Solution-Graphs of Boolean Formulas and Isomorphism

      • Patrick Scharpfenecker, Jacobo Torán
      Pages 29-44

    5. Strong Backdoors for Default Logic

      • Johannes K. Fichte, Arne Meier, Irina Schindler
      Pages 45-59

    6. The Normalized Autocorrelation Length of Random Max \(r\)-Sat Converges in Probability to \((1-1/2^r)/r\)

      • Daniel Berend, Yochai Twitto
      Pages 60-76

    7. Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle

      • Vsevolod Oparin
      Pages 77-84

  3. Satisfiability Solving

    1. Front Matter

      Pages 85-85
      Download chapter PDF

    2. Extreme Cases in SAT Problems

      • Gilles Audemard, Laurent Simon
      Pages 87-103

    3. Improved Static Symmetry Breaking for SAT

      • Jo Devriendt, Bart Bogaerts, Maurice Bruynooghe, Marc Denecker
      Pages 104-122

    4. Learning Rate Based Branching Heuristic for SAT Solvers

      • Jia Hui Liang, Vijay Ganesh, Pascal Poupart, Krzysztof Czarnecki
      Pages 123-140

    5. On the Hardness of SAT with Community Structure

      • Nathan Mull, Daniel J. Fremont, Sanjit A. Seshia
      Pages 141-159

    6. Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers

      • 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
      Download chapter PDF

    2. A SAT Approach to Branchwidth

      • Neha Lodha, Sebastian Ordyniak, Stefan Szeider
      Pages 179-195

    3. Computing Maximum Unavoidable Subgraphs Using SAT Solvers

      • C. K. Cuong, M. J. H. Heule
      Pages 196-211

    4. Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT

      • Mathias Soeken, Alan Mishchenko, Ana Petkovska, Baruch Sterin, Paolo Ienne, Robert K. Brayton et al.
      Pages 212-227

    5. Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer

      • Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek
      Pages 228-245

  5. Satisfiability Modulo Theory

    1. Front Matter

      Pages 247-247
      Download chapter PDF
Back to top

Other volumes

  1. Theory and Applications of Satisfiability Testing – SAT 2016

Keywords

About this book

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.

 

Editors and Affiliations

  • Aix-Marseille Université, Marseille, France

    Nadia Creignou

  • Université d'Artois, Lens, France

    Daniel Le Berre

Bibliographic Information

  • Book Title: Theory and Applications of Satisfiability Testing – SAT 2016

  • Book Subtitle: 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings

  • Editors: Nadia Creignou, Daniel Le Berre

  • Series Title: Lecture Notes in Computer Science

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

  • Publisher: Springer Cham

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

  • Copyright Information: Springer International Publishing Switzerland 2016

  • Softcover ISBN: 978-3-319-40969-6Published: 12 June 2016

  • eBook ISBN: 978-3-319-40970-2Published: 10 June 2016

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XXIV, 564

  • Number of Illustrations: 119 b/w illustrations

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

Publish with us

Policies and ethics

Back to top

Search

Navigation