SAT 2005

Satisfiability Research in the Year 2005

  • Enrico Giunchiglia
  • Toby Walsh
Conference proceedings

Table of contents

  1. Front Matter
    Pages i-v
  2. Enrico Giunchiglia, Toby Walsh
    Pages 1-2
  3. Ateet Bhalla, Inês Lynce, José T. de Sousa, João Marques-Silva
    Pages 3-24
  4. Guoqiang Pan, Moshe Y. Vardi
    Pages 25-50
  5. Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson
    Pages 51-72
  6. Stefan Szeider
    Pages 73-88
  7. Jan Johannsen
    Pages 89-95
  8. John Thornton
    Pages 97-142
  9. Alan M. Frisch, Timothy J. Peugniez, Anthony J. Doggett, Peter W. Nightingale
    Pages 143-179
  10. Yacine Boufkhad, Olivier Dubois, Yannet Interian, Bart Selman
    Pages 181-200
  11. Andreas Meier, Volker Sorge
    Pages 201-235
  12. Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea
    Pages 237-263
  13. Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Peter van Rossum, Stephan Schulz et al.
    Pages 265-293

About these proceedings

Introduction

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.

As this volume demonstrates, research has continued very actively in this area since then. This book follows on from the highly successful volume entitled SAT 2000 published five years ago. The papers in SAT 2005 fall (not entirely neatly) into the following

categories: complete methods, local and stochastic search methods, random problems, applications, and extensions beyond the propositional.

Keywords

Automat Extension Principia Mathematica algorithms artificial intelligence automated deduction classification complexity complexity theory intelligence logic software verification verification

Editors and affiliations

  • Enrico Giunchiglia
    • 1
  • Toby Walsh
    • 2
  1. 1.Università di GenovaItaly
  2. 2.National ICT Australia and University of New South WalesSydneyAustralia

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4020-5571-3
  • Copyright Information Springer 2006
  • Publisher Name Springer, Dordrecht
  • eBook Packages Computer Science
  • Print ISBN 978-1-4020-4552-3
  • Online ISBN 978-1-4020-5571-3