Skip to main content
  • Conference proceedings
  • © 2016

Theory and Applications of Satisfiability Testing – SAT 2016

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

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)

Conference series link(s): SAT: International Conference on Theory and Applications of Satisfiability Testing

Conference proceedings info: SAT 2016.

Buying options

eBook USD 79.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-40970-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 99.99
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (36 papers)

  1. Front Matter

    Pages I-XXIV
  2. Complexity

    1. Front Matter

      Pages 1-1
    2. Satisfiability via Smooth Pictures

      • Mateus de Oliveira Oliveira
      Pages 13-28
    3. Solution-Graphs of Boolean Formulas and Isomorphism

      • Patrick Scharpfenecker, Jacobo Torán
      Pages 29-44
    4. Strong Backdoors for Default Logic

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

    1. Front Matter

      Pages 85-85
    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
    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

Other Volumes

  1. Theory and Applications of Satisfiability Testing – SAT 2016

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

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.

 

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

  • Aix-Marseille Université, Marseille, France

    Nadia Creignou

  • Université d'Artois, Lens, France

    Daniel Le Berre

Bibliographic Information

Buying options

eBook USD 79.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-40970-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 99.99
Price excludes VAT (USA)