Skip to main content
  • Conference proceedings
  • © 2006

SAT 2005

Satisfiability Research in the Year 2005

  • Presents an up to date snapshot of a very active research area
  • Provides many practical applications (especially in the area of hardware verification)
  • Presents a survey of the breadth of research in this area

Buy it now

Buying options

eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

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

Table of contents (12 papers)

  1. Front Matter

    Pages i-v
  2. Satisfiability in the Year 2005

    • Enrico Giunchiglia, Toby Walsh
    Pages 1-2
  3. Heuristic-Based Backtracking Relaxation for Propositional Satisfiability

    • Ateet Bhalla, Inês Lynce, José T. de Sousa, João Marques-Silva
    Pages 3-24
  4. Symbolic Techniques in Satisfiability Solving

    • Guoqiang Pan, Moshe Y. Vardi
    Pages 25-50
  5. Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas

    • Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson
    Pages 51-72
  6. Backdoor Sets for DLL Subsolvers

    • Stefan Szeider
    Pages 73-88
  7. The Complexity of Pure Literal Elimination

    • Jan Johannsen
    Pages 89-95
  8. Clause Weighting Local Search for SAT

    • John Thornton
    Pages 97-142
  9. Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings

    • Alan M. Frisch, Timothy J. Peugniez, Anthony J. Doggett, Peter W. Nightingale
    Pages 143-179
  10. Regular Random k-SAT: Properties of Balanced Formulas

    • Yacine Boufkhad, Olivier Dubois, Yannet Interian, Bart Selman
    Pages 181-200
  11. Applying SAT Solving in Classification of Finite Algebras

    • Andreas Meier, Volker Sorge
    Pages 201-235
  12. The SAT-based Approach to Separation Logic

    • Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea
    Pages 237-263
  13. MathSAT: Tight Integration of SAT and Mathematical Decision Procedures

    • Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Peter van Rossum, Stephan Schulz et al.
    Pages 265-293

About this book

This book is devoted to recent progress made in solving propositional satisfiability and related problems. 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. Research into methods to automate such reasoning has therefore a long history in artificial intelligence. In 1957, Allen Newell and Herb Simon introduced the Logic Theory Machine to prove propositional theorems from Whitehead and Russel's "Principia mathematica".

In 1960, Martin Davis and Hillary Putnam introduced their eponymous decision procedure for satisfiability reasoning (though, for space reasons, it was quickly superseded by the modified procedure proposed by Martin Davis, George Logemann and Donald Loveland two years later). In 1971, Stephen Cook's proof that propositional satisfiability is NP-Complete placed satisfiability as the cornerstone of complexity theory.

Editors and Affiliations

  • Università di Genova, Italy

    Enrico Giunchiglia

  • National ICT Australia and University of New South Wales, Sydney, Australia

    Toby Walsh

Bibliographic Information

  • Book Title: SAT 2005

  • Book Subtitle: Satisfiability Research in the Year 2005

  • Editors: Enrico Giunchiglia, Toby Walsh

  • DOI: https://doi.org/10.1007/978-1-4020-5571-3

  • Publisher: Springer Dordrecht

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer Science+Business Media B.V. 2006

  • Hardcover ISBN: 978-1-4020-4552-3Published: 30 October 2006

  • Softcover ISBN: 978-94-007-8715-5Published: 03 December 2014

  • eBook ISBN: 978-1-4020-5571-3Published: 21 January 2007

  • Edition Number: 1

  • Number of Pages: VII, 293

  • Additional Information: Reprinted from JOURNAL OF AUTOMATED REASONING,

  • Topics: Software Engineering/Programming and Operating Systems, Artificial Intelligence, Theory of Computation

Buy it now

Buying options

eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access