Skip to main content
Book cover

Theory and Applications of Satisfiability Testing - SAT 2009

12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings

  • Conference proceedings
  • © 2009

Overview

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

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

Included in the following conference series:

Conference proceedings info: SAT 2009.

This is a preview of subscription content, log in via an institution to check access.

Access this book

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

  1. Applications of SAT

  2. Complexity Theory

  3. Structures for SAT

  4. Resolution and SAT

  5. Translations to CNF

Other volumes

  1. Theory and Applications of Satisfiability Testing - SAT 2009

Keywords

About this book

This volume contains the papers presented at SAT 2009: 12th International Conference on Theory and Applications of Satis?ability Testing, held from June 30 to July 3, 2009 in Swansea (UK). The International Conference on Theory and Applications of Satis?ability Testing (SAT) started in 1996 as a series of workshops, and, in parallel with the growthof SAT, developedinto the main eventfor SAT research. This year’sc- ference testi?ed to the strong interest in SAT, regarding theoretical research,- searchonalgorithms,investigationsintoapplications,anddevelopmentofsolvers and software systems. As a core problem of computer science, SAT is central for many research areas, and has deep interactions with many mathematical s- jects. Major impulses for the development of SAT came from concrete practical applications as well as from fundamental theoretical research. This fruitful c- laboration can be seen in virtually all papers of this volume. There were 86 submissions (completed papers within the scope of the c- ference). Each submission was reviewed by at least three, and on average 4. 0 Programme Committee members. The Committee decided to accept 45 papers, consisting of 34 regular and 11 short papers (restricted to 6 pages). A main n- elty was a “shepherding process”, where 29% of the papers were accepted only conditionally, and requirements on necessary improvements were formulated by the ProgrammeCommittee and its installment monitored by the “shepherd” for thatpaper(using possibly severalroundsoffeedback).

Editors and Affiliations

  • Computer Science Department, Swansea University, Swansea, UK

    Oliver Kullmann

Bibliographic Information

Publish with us