Limit search to available items
Book Cover
E-book
Author SAT 2008 (2008 : Guangzhou, China)

Title Theory and applications of satisfiability testing--SAT 2008 : 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008 : proceedings / Hans Kleine Büning, Xishun Zhao (eds.)
Published Berlin ; New York : Springer, ©2008

Copies

Description 1 online resource (x, 304, [1] pages) : illustrations
Series Lecture notes in computer science, 0302-9743 ; 4996
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Lecture notes in computer science ; 4996. 0302-9743
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
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
Summary 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
Bibliography Includes bibliographical references and index
Notes English
Subject Propositional calculus -- Congresses
Decision making -- Congresses
Computer algorithms -- Congresses
Algebra, Boolean -- Congresses
Computer algorithms.
Algebra, Boolean.
Propositional calculus.
Decision making.
Informatique.
Algebra, Boolean
Computer algorithms
Decision making
Propositional calculus
Genre/Form proceedings (reports)
Conference papers and proceedings
Conference papers and proceedings.
Actes de congrès.
Form Electronic book
Author Kleine Büning, H. (Hans)
Zhao, Xishun
ISBN 9783540797180
3540797181
9783540797197
354079719X
9788354079712
8354079716
Other Titles Satisfiability testing
SAT 2008