Theory and Applications of Satisfiability Testing - SAT 2008: 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008, Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$64.56
Used and New from Other Sellers
Used and New from Other Sellers
from $1.99
Usually ships in 1-2 business days
(Save 97%)
Other sellers (Paperback)
  • All (13) from $1.99   
  • New (10) from $16.30   
  • Used (3) from $1.99   

Overview

This book constitutes the refereed proceedings of the 11th International Conference on Theory and Applications of Satisfiability Testing, SAT 2008, held in Guangzhou, P. R. China, in May 2008.

The 17 revised full papers presented together with 8 revised short papers and 2 invited talks were carefully selected from 70 submissions. All current research issues in propositional and quantified Boolean formula satisfiability testing are covered, including but not limited to proof systems, proof complexity, search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, simplifiers, tools, case studies and empirical results.

Read More Show Less

Product Details

Table of Contents

Modelling Max-CSP as Partial Max-SAT.- A Preprocessor for Max-SAT Solvers.- A Generalized Framework for Conflict Analysis.- Adaptive Restart Strategies for Conflict Driven SAT Solvers.- New Results on the Phase Transition for Random Quantified Boolean Formulas.- Designing an Efficient Hardware Implication Accelerator for SAT Solving.- Attacking Bivium Using SAT Solvers.- SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers.- Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms.- Complexity and Algorithms for Well-Structured k-SAT Instances.- A Decision-Making Procedure for Resolution-Based SAT-Solvers.- Online Estimation of SAT Solving Runtime.- A Max-SAT Inference-Based Pre-processing for Max-Clique.- SAT, UNSAT and Coloring.- Computation of Renameable Horn Backdoors.- A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors.- Improvements to Hybrid Incremental SAT Algorithms.- Searching for Autarkies to Trim Unsatisfiable Clause Sets.- Nenofex: Expanding NNF for QBF Solving.- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions.- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms.- A CNF Class Generalizing Exact Linear Formulas.- How Many Conflicts Does It Need to Be Unsatisfiable?.- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning.- Local Restarts.- Regular and General Resolution: An Improved Separation.- Finding Guaranteed MUSesFast.

Read More Show Less

Customer Reviews

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

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com 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 & Noble.com 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 & Noble.com 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 BN.com 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

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com 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 BN.com. 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)