Limit search to available items
Book Cover

Title SAT 2005 : satisfiability research in the year 2005 / edited by Enrico Giunchiglia and Toby Walsh
Published Dordrecht : Springer, [2006]
Online access available from:
Springer eBooks    View Resource Record  


Description 1 online resource (293 pages) : illustrations
Contents Satisfiability in the Year 2005; Heuristic-Based Backtracking Relaxation for Propositional Satisfiability; Symbolic Techniques in Satisfiability Solving; Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas; Backdoor Sets for DLL Subsolvers; The Complexity of Pure Literal Elimination; Clause Weighting Local Search for SAT; Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings; Regular Random k-SAT: Properties of Balanced Formulas; Applying SAT Solving in Classification of Finite Algebras
Summary Propositional satisfiability is a powerful and general formalism used to solve a wide range of important problems including hardware and software verification. The core of many reasoning problems in automated deduction are propositional. This work deals with the progress made in solving propositional satisfiability and related problems
Notes "Reprinted from Journal of automated reasoning, v. 35, nos. 1-3 (2005)."
Bibliography Includes bibliographical references
Notes Print version record
Subject Computer algorithms.
Computational complexity.
Propositional calculus.
Form Electronic book
Author Giunchiglia, Enrico.
Walsh, Toby.
LC no. 2007398861
ISBN 9781402055713
9781402045523 (hb)
1402045522 (hb)
Other Titles Satisfiability research in the year 2005
OTHER TI Journal of automated reasoning. Vol. 35, no. 1-3