Theory and Applications of Satisfiability Testing: 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003, Selected Revised Papers / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $89.90
Usually ships in 1-2 business days
(Save 30%)
Other sellers (Paperback)
  • All (9) from $89.90   
  • New (6) from $93.65   
  • Used (3) from $89.90   


This book constitutes the thoroughly refereed post-proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing, SAT 2003, held in Santa Margherita Ligure, Italy, in May 2003.

The 33 revised full papers presented together with 5 articles reporting results of the related SAT competition and QBF evaluation were carefully selected during two rounds of reviewing and improvement from 67 submissions. The whole spectrum of research in propositional and quantified Boolean formula satisfiability testing is covered including proof systems, search techniques, probabilistic analysis of algorithms and their properties, problem encodings, industrial applications, specific tools, case studies, and empirical results.

Read More Show Less

Product Details

  • ISBN-13: 9783540208518
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 3/19/2004
  • Series: Lecture Notes in Computer Science Series, #2919
  • Edition description: 2004
  • Edition number: 1
  • Pages: 530
  • Product dimensions: 9.21 (w) x 6.14 (h) x 1.11 (d)

Table of Contents

Satisfiability and computing van der Waerden numbers 1
An algorithm for SAT above the threshold 14
Watched data structures for QBF solvers 25
How good can a resolution based SAT-solver be? 37
A local search SAT solver using an effective switching strategy and an efficient unit propagation 53
Density condensation of Boolean formulas 69
SAT based predicate abstraction for hardware verification 78
On Boolean models for quantified Boolean horn formulas 93
Local search on SAT-encoded colouring problems 105
A study of pure random walk on random satisfiability problems with "physical" methods 120
Hidden threshold phenomena for fixed-density SAT-formulae 135
Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs 150
Width-based algorithms for SAT and CIRCUIT-SAT 162
Linear time algorithms for some not-all-equal satisfiability problems 172
On fixed-parameter tractable parameterizations of SAT 188
On the probabilistic approach to the random satisfiability problem 203
Comparing different prenexing strategies for quantified Boolean formulas 214
Solving error correction for large data sets by means of a SAT solver 229
Using problem structure for efficient clause learning 242
Abstraction-driven SAT-based analysis of security protocols 257
A case for efficient solution enumeration 272
Cache performance of SAT solvers : a case study for efficient implementation of algorithms 287
Local consistencies in SAT 299
Guiding SAT diagnosis with tree decompositions 315
On computing k-CNF formula properties 330
Effective preprocessing with hyper-resolution and equality reduction 341
Read-once unit resolution 356
The interaction between inference and branching heuristics 370
Hypergraph reductions and satisfiability problems 383
SBSAT : a state-based, BDD-based satisfiability solver 398
Computing vertex eccentricity in exponentially large graphs : QBF formulation and solution 411
The combinatorics of conflicts between clauses 426
Conflict-based selection of branching rules 441
The essentials of the SAT 2003 competition 452
Challenges in the QBF arena : the SAT'03 evaluation of QBF solvers 468
kcnfs : an efficient solver for random k-SAT formulae 486
An extensible SAT-solver 502
Survey and belief propagation on random K-SAT 519
Author index 529
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)