SAT 2005: Satisfiability Research in the Year 2005 - Couverture rigide

Couverture rigide

ISBN 10 : 1402045522 ISBN 13 : 9781402045523

Editeur : Springer-Verlag New York Inc., 2006

Synopsis

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.

Détails de l'édition

• Éditeur: Springer-Verlag New York Inc.
• Date d'édition: 2006
• Langue: anglais
• ISBN 10: 1402045522
• ISBN 13: 9781402045523
• Reliure: Relié
• Nombre de pages: 300
• Éditeur: Giunchiglia Enrico, Walsh Toby
• Coordonnées du fabricant: non disponible
• Personne responsable: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Allemagne